Frodo was caught by Saruman. He tore a pouch from Frodo's neck, shook out its contents —there was a pile of different rings: gold and silver...

"How am I to tell which is the One?!" the mage howled.

"Throw them one by one into the Cracks of Doom and watch when Mordor falls!" 

Somewhere in a parallel Middle-earth, when Saruman caught Frodo, he only found n rings. And the i-th ring was either gold or silver. For convenience Saruman wrote down a binary string s of n characters, where the i-th character was 0 if the i-th ring was gold, and 1 if it was silver.

Saruman has a magic function f, which takes a binary string and returns a number obtained by converting the string into a binary number and then converting the binary number into a decimal number. For example, f(001010) = 10, f(111) = 7, f(11011101) = 221.

Saruman, however, thinks that the order of the rings plays some important role. He wants to find 2 pairs of integers (l_1, r_1), (l_2, r_2), such that:

  * 1 ≤ l_1 ≤ n, 1 ≤ r_1 ≤ n, r_1-l_1+1≥ ⌊ n/2 ⌋ 
  * 1 ≤ l_2 ≤ n, 1 ≤ r_2 ≤ n, r_2-l_2+1≥ ⌊ n/2 ⌋ 
  * Pairs (l_1, r_1) and (l_2, r_2) are distinct. That is, at least one of l_1 ≠ l_2 and r_1 ≠ r_2 must hold.
  * Let t be the substring s[l_1:r_1] of s, and w be the substring s[l_2:r_2] of s. Then there exists non-negative integer k, such that f(t) = f(w) ⋅ k.



Here substring s[l:r] denotes s_ls_{l+1}… s_{r-1}s_r, and ⌊ x ⌋ denotes rounding the number down to the nearest integer.

Help Saruman solve this problem! It is guaranteed that under the constraints of the problem at least one solution exists.

Input

Each test contains multiple test cases.

The first line contains one positive integer t (1 ≤ t ≤ 10^3), denoting the number of test cases. Description of the test cases follows.

The first line of each test case contains one positive integer n (2 ≤ n ≤ 2 ⋅ 10^4) — length of the string.

The second line of each test case contains a non-empty binary string of length n.

It is guaranteed that the sum of n over all test cases does not exceed 10^5.

Output

For every test case print four integers l_1, r_1, l_2, r_2, which denote the beginning of the first substring, the end of the first substring, the beginning of the second substring, and the end of the second substring, respectively.

If there are multiple solutions, print any.

Example

Input


7
6
101111
9
111000111
8
10000000
5
11011
6
001111
3
101
30
100000000000000100000000000000


Output


3 6 1 3
1 9 4 9
5 8 1 4
1 5 3 5
1 6 2 4
1 2 2 3
1 15 16 30

Note

In the first testcase f(t) = f(1111) = 15, f(w) = f(101) = 5.

In the second testcase f(t) = f(111000111) = 455, f(w) = f(000111) = 7.

In the third testcase f(t) = f(0000) = 0, f(w) = f(1000) = 8.

In the fourth testcase f(t) = f(11011) = 27, f(w) = f(011) = 3.

In the fifth testcase f(t) = f(001111) = 15, f(w) = f(011) = 3.
import java.io.*;
import java.lang.reflect.Array;
import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.*;



public class copy{
    public static int find(int a,int[] parent)
    {
        if(parent[a]==a)
            return a;
        return find(parent[a],parent);
    }

    public static void union(int a,int b,int[] parent, int[] rank)
    {
        int x=find(a,parent);
        int y=find(b,parent);
        if(rank[x]>rank[y])
        {
            parent[y]=x;

        }
        else if(rank[y]>rank[x])
        {
            parent[x]=y;

        }
        else
        {
            parent[y]=x;
            rank[x]++;

        }
    }

    static double answer;

    public static int check(ArrayList<ArrayList<Integer>> edges,int x,int parent,int[] statues,int n)
    {
        ArrayList<Integer> arr=new ArrayList<>();
        for(int i:edges.get(x))
        {
            if(i!=parent)
            {
                arr.add(check(edges,i,x,statues,n));
            }
        }
        int sum=0;
        for(int i=arr.size()-1;i>=0;i--)
        {

            answer+=((long)arr.get(i)*(long)sum*(long)statues[x])/((double)n*(double)(n-1));
            sum+=arr.get(i);
        }
        answer+=((long)sum*(long)statues[x])/((double)n*(double)(n-1));
        //System.out.println(x+" "+sum);
        return 1+sum;
    }

    public static boolean check(int X,int a,int b)
    {
        System.out.println(X);

        if(X==1)
            return true;
        boolean status=false;
        if(X%a==0 && a!=1)
            status=status || check(X/a,a,b);
        if(X-b>=1 && b!=0)
            status=status || check(X-b,a,b);

        return status;


    }

    public static int check(long xor,ArrayList<Long> sum,int low,int N)
    {
        int l=low;
        int r=N-1;
        while(l<=r)
        {
            int mid=(l+r)/2;
            if(sum.get(mid)==xor)
            {
                return mid;
            }
            else
                r=mid-1;
        }

        return 0;
    }

    public static void merge(int l,int mid,int r,cp[] arr,HashMap<Integer,Integer> before)
    {
        int N=mid-l+1,M=r-mid;
        cp[] arr1=new cp[mid-l+1];
        cp[] arr2=new cp[r-mid];
        cp[] arr3=new cp[N+M];
        for(int i=l;i<=mid;i++)
            arr1[i-l]=arr[i];
        for(int i=mid+1;i<=r;i++)
            arr2[i-mid-1]=arr[i];
        int left=0,right=0,k=0;
        while(left<N && right<M)
        {

            if(arr1[left].a<arr2[right].a)
            {
                arr3[k++]=arr1[left++];
            }
            else
            {

                before.put(arr2[right].b,before.getOrDefault(arr2[right].b,0)+N-left);
                count+=N-left;
                arr3[k++]=arr2[right++];
            }
        }

        while(left<N)
        {
            arr3[k++]=arr1[left++];
        }

        while(right<M)
        {
            arr3[k++]=arr2[right++];
        }

        for(int i=l;i<=r;i++)
            arr[i]=arr3[i-l];



    }

    public static void inv(HashMap<Integer,Integer> before,int l,int r,cp[] arr)
    {
        if(l==r)
            return;
        int mid=(l+r)/2;
        inv(before,l,mid,arr);
        inv(before,mid+1,r,arr);
        merge(l,mid,r,arr,before);
    }
    static long count=0;
    public static int check(ArrayList<Long> arr,long X,int low,int N,long mod)
    {
        int l=low;
        int r=N;
        while(l<=r)
        {
            int mid=l+(r-l)/2;
            if(((arr.get(mid)-arr.get(low-1)))/(long)(mid-low+1)<X)
            {
                if(mid+1<=N &&  ((arr.get(mid+1)-arr.get(low-1)))/(long)(mid-low+2)<X)
                    l=mid+1;
                else
                    return mid;
            }
            else
                r=mid-1;
        }

        return -1;
    }

    public static void check(ArrayList<ArrayList<Integer>> arr,int x,int parent,ArrayList<Integer> answer)
    {
        answer.add(x);
        for(int i:arr.get(x))
        {
            if(i!=parent)
            {
                check(arr,i,x,answer);
                answer.add(x);
            }
        }

    }

    static long binpow( long a,  long b,  long m) {
        a %= m;
        long  res = 1;
        while (b > 0) {
            if ((b & 1)==1)
                res = res * a % m;
            a = a * a % m;
            b >>= 1;
        }
        return res;
    }
    public static int check(int N,int a,int b,int c,int[] dp)
    {
        if(dp[N]!=-2)
            return dp[N];
        if(N==0)
            return 0;

        int a1=-1,a2=-1,a3=-1;
        if(N>=a)
            a1=check(N-a,a,b,c,dp);
        if(N>=b)
            a2=check(N-b,a,b,c,dp);
        if(N>=c)
            a3=check(N-c,a,b,c,dp);
        if(a1==-1 && a2==-1 && a3==-1)
            dp[N]=-1;
        else
            dp[N]= 1+Math.max(a1,Math.max(a2,a3));
        return dp[N];
    }



    public static long gcd(long a,long b)
    {
        if(a==0)
            return b;

        return gcd(b%a,a);
    }


    public static int check(ArrayList<Double> arr,double number,int N)
    {
        int l=0;
        int r=N;
        while(l<=r)
        {
            int mid=(l+r)/2;
            if(number>=arr.get(mid))
            {
                if(mid+1<=N && arr.get(mid+1)<=number)
                    l=mid+1;
                else
                    return mid;
            }
            else
                r=mid-1;
            //System.out.println("hello");
        }

        return 0;
    }


//    public static int check(ArrayList<String> arr)
//    {
//        int ans=Integer.MAX_VALUE;
//        ArrayList<Character> copy=new ArrayList<>();
//        for(char ch='a';ch<='z';ch++)
//        {
//            int s1=0;
//            for(String s:arr)
//                if(s.indexOf(ch)!=-1)
//                    ++s1;
//            if(s1>1)
//            {
//                copy.add(ch);
//            }
//
//        }
//        if(copy.size()==0) {
//            for (char ch = 'a'; ch <= 'z'; ch++) {
//                int s1 = 0, s2 = 0;
//                for (String s : arr)
//                    if (s.indexOf(ch) != -1)
//                        s1 += s.length();
//                    else
//                        s2 += s.length();
//
//                //System.out.println(ch+" "+s1+" "+s2);
//                ans = Math.min(ans, Math.abs(s1 - s2));
//
//            }
//        }
//        else
//        {
//            for (char ch:copy) {
//                int s1 = 0, s2 = 0;
//                for (String s : arr)
//                    if (s.indexOf(ch) != -1)
//                        s1 += s.length();
//                    else
//                        s2 += s.length();
//
//                //System.out.println(ch+" "+s1+" "+s2);
//                ans = Math.min(ans, Math.abs(s1 - s2));
//
//            }
//        }
//
//        return ans;
//    }
    static int size;

    public static void swap(int[] arr,int x,int y)
    {
        int temp=arr[x];
        arr[x]=arr[y];
        arr[y]=temp;
    }


    public static void delete(int[] arr)
    {
        swap(arr,0,size-1);
        --size;
        heapify(arr,0);
    }

    public static void heapify(int[] arr,int x)
    {
        int largest=x;
        int left_child=2*x;
        int right_child=2*x+1;

        if(left_child<size && arr[left_child]>arr[largest])
            largest=left_child;
        if(right_child<size && arr[right_child]>arr[largest])
            largest=right_child;

        if(largest!=x)
        {
            swap(arr,x,largest);
            heapify(arr,largest);
        }
    }

    public static int check(ArrayList<Integer> arr,int N,int X)
    {
        int l=0,r=N-1;
        while(l<=r)
        {
            int mid=(l+r)/2;

            if(arr.get(mid)<=X)
            {

                if(mid+1<N && arr.get(mid+1)<=X)
                    l=mid+1;
                else
                    return mid;
            }
            else
                r=mid-1;
        }

        return -1;
    }

    public static cord check(ArrayList<Integer> arr)
    {
       int initial=0,level=0;
       int index=0;
       for(int i=0;i<arr.size();i++)
       {
           if(arr.get(i)<level)
               level+=1;
           else
           {
               initial+=arr.get(i)-level+1;
               level=arr.get(i)+1;
               level+=1;
           }
           //System.out.println(level+" "+i+" "+initial);
       }

       return new cord(initial,initial+arr.size());
    }

    public static boolean vowel(char ch)
    {
        if(ch=='a' || ch=='e' || ch=='i' || ch=='o' || ch=='u')
            return true;
        return false;
    }

    public static int check(String s,int start)
    {
        if(start==s.length())
            return 0;
        if(vowel(s.charAt(start)))
            return 1+check(s,start+1);
        else
            return check(s,start+1);


    }













    public static void main(String[] args)throws IOException
    {
        Reader.init(System.in);
        BufferedWriter output=new BufferedWriter(new OutputStreamWriter(System.out));
        int T=Reader.nextInt();
        A:for(int m=1;m<=T;m++)
        {
            int digits=Reader.nextInt();
            String s=Reader.next();
            int till=digits-(digits/2-1);
            s='0'+s;
            for(int i=1;i<till;i++)
            {
                if(s.charAt(i)=='0')
                {
                    output.write((i)+" "+digits+" "+(i+1)+" "+digits+"\n");
                    continue A;

                }

            }
            for(int i=digits;i>=digits/2+1;i--)
            {
                if(s.charAt(i)=='0')
                {
                    output.write(1+" "+(i)+" "+1+" "+(i-1)+"\n");
                    continue A;
                }
            }

            output.write(1+" "+(digits)+" "+2+" "+(digits)+"\n");

        }






        output.flush();

    }
}

class cord
{
    int x;
    int y;
    cord(int x,int y)
    {
        this.x=x;
        this.y=y;
    }
}

class cp
{
    int a,b;
    cp(int a,int b)
    {
        this.a=a;
        this.b=b;

    }
}

class sort_cp implements Comparator<cp>
{
    public int compare(cp o1,cp o2)
    {
        return o2.b-o1.b;
    }
}
class g_node{
    int val;
    long wt;

    g_node(int val, long wt)
    {
        this.val = val;
        this.wt = wt;
    }
}
class Reader {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}