pll find_largest_range(vll& a,string& s,ll st,ll en, ll n){

    ll minn = a[st];
    ll maxx = a[st];
    forl(i,st,en+1){
        if(a[i]<minn)
            minn = a[i];
        if(a[i]>maxx)
            maxx = a[i];
    }

    ll left = st-1;
    ll right = en+1;
    pll stable = make_pair(-1ll,-1ll);

    while(left>=0 && right<n){
        while(left>=0 && right<n){
            while(left>=0 && a[left]>=minn){
                maxx = max(maxx,a[left]);
                left--;
            }

            if(left<0 || a[left]>=minn)
                return stable;

            ll next_left = left;
            ll ind_left = left-1;
            while(ind_left>=0 && a[ind_left+1]<maxx){
                minn = min(minn,a[ind_left+1]);
                if(a[ind_left]<minn)
                    next_left = ind_left;
                ind_left--;
            }
            left = next_left;

            while(right<n && a[right]<=maxx){
                minn = min(minn,a[right]);
                right++;
            }
            if(right>=n || a[right]<=maxx)
                return stable;

            ll next_right = right;
            ll ind_right = right+1;
            right++;
            while(right<n && a[ind_right-1]>minn){
                maxx = max(maxx,a[ind_right-1]);
                if(a[ind_right]>maxx)
                    next_right = ind_right;
                ind_right++;
            }
            right = ind_right;

            if(a[left]<minn){
                stable = make_pair(left,right);
                minn = a[left];
                maxx = a[right];
                left--;
                right++;   
                break;
            }
        }                     
    }
    return stable;
}

void solve(int tt) 
{
    ll n;
    cin>>n;

    vll a(n);

    string s;

    forl(i,0,n)cin>>a[i];
    cin>>s;

    vll aa = a;
    forl(i,0,n)aa[i] = -a[i];

    debug(n,a,s);

    vector<pll> ranges;

    forl(i,0,n){
        ll j = i;
        while(j<n && s[j]==s[i]){
            j++;
        }
        j--;
        if(s[j]=='0')
            continue;

        if(s[j]=='1'){
            pll r1 = find_largest_range(a,s,i,j,n);
            pll r2 = find_largest_range(aa,s,i,j,n);
            if(r1.second - r1.first > r2.second - r2.first)
                ranges.push_back(r1);
            else{
                if(r2.first < r2.second)
                    ranges.push_back(r2);
                else{
                    print(-1);
                    return;
                }
            }
        }

        ll sz = ranges.size();
        if(sz>5){
            print(-1);
            return;
        }
        i = ranges[sz-1].second-1;
    }

    print(ranges.size());
    for(auto p: ranges){
        print(p.first+1,p.second+1);
    }
}