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.util.*;

import java.io.*;

public class cf {
    static Reader sc = new Reader();
    static PrintWriter out = new PrintWriter(System.out);
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) {
        int tc = sc.ni();
        while (tc-- > 0) {
            int n=sc.ni();
            char[] s=sc.next().toCharArray();

            int ZeroInLeftHalf=-1, ZeroInRightHalf = -1;
            for(int i=0;i<n/2;i++){
                if(s[i]=='0'){
                    ZeroInLeftHalf=i;
                    break;
                }
            }
            for (int i = n/2; i < n; i++) {
                if (s[i] == '0') {
                    ZeroInRightHalf = i;
                    break;
                }
            }
            if(ZeroInLeftHalf!=-1){
                out.println((ZeroInLeftHalf+1) +" "+n+" "+(ZeroInLeftHalf + 2) + " " + n);
            }else if(ZeroInRightHalf!=-1){
                out.println(1 + " " +(ZeroInRightHalf)+" "+ 1 + " " + (ZeroInRightHalf + 1));
            }else{
                if(n%2==0){
                    out.println(1+" "+(n/2)+" "+(n/2+1)+" "+n);
                }else{
                    out.println(1+" "+(n/2)+" "+(n/2+2)+" "+n);
                }                    
            }
        }
        out.close();

    }
    

    public static long pow(long a, long b, long m) {
        if (b == 0) {
            return 1;
        }
        if (b % 2 == 0) {
            return pow((a * a) % m, b / 2, m) % m;
        } else {
            return (a * pow((a * a) % m, b / 2, m)) % m;
        }
    }

    // snippets

    static class Pair implements Comparable<Pair> {
        int x;
        int y;

        Pair(int x, int y) {
            this.x = x;
            this.y = y;

        }

        @Override
        public int compareTo(Pair o) {
            if (this.x > o.x)
                return 1;
            else if (this.x < o.x)
                return -1;
            else {
                if (this.y > o.y)
                    return 1;
                else if (this.y < o.y)
                    return -1;
                else
                    return 0;
            }
        }

        public int hashCode() {
            int ans = 1;
            ans = x * 31 + y * 13;
            return ans;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) {
                return true;
            }
            if (o == null) {
                return false;
            }
            if (this.getClass() != o.getClass()) {
                return false;
            }
            Pair other = (Pair) o;
            if (this.x == other.x && this.y == other.y) {
                return true;
            }
            return false;
        }

    }

    static void add_map(HashMap<Integer, Integer> map, int v) {
        if (!map.containsKey(v)) {
            map.put(v, 1);
        } else {
            map.put(v, map.get(v) + 1);
        }
    }

    static void remove_map(HashMap<Integer, Integer> map, int v) {
        if (map.containsKey(v)) {
            map.put(v, map.get(v) - 1);
            if (map.get(v) == 0)
                map.remove(v);
        }
    }

    static int gcd(int a, int b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

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

    static void sort(int[] arr) {
        // shuffle
        Random rand = new Random();
        for (int i = 0; i < arr.length; i++) {
            int j = rand.nextInt(i + 1);
            int tmp = arr[i];
            arr[i] = arr[j];
            arr[j] = tmp;
        }
        Arrays.sort(arr);
    }

    static void sort(long[] arr) {
        // shuffle
        Random rand = new Random();
        for (int i = 0; i < arr.length; i++) {
            int j = rand.nextInt(i + 1);
            long tmp = arr[i];
            arr[i] = arr[j];
            arr[j] = tmp;
        }
        Arrays.sort(arr);
    }

    static boolean isPrime(int n) {
        if (n <= 1)
            return false;
        if (n <= 3)
            return true;
        if (n % 2 == 0 || n % 3 == 0)
            return false;
        double sq = Math.sqrt(n);

        for (int i = 5; i <= sq; i = i + 6)
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        return true;
    }

    static boolean isPrime(long n) {
        if (n <= 1)
            return false;
        if (n <= 3)
            return true;
        if (n % 2 == 0 || n % 3 == 0)
            return false;
        double sq = Math.sqrt(n);

        for (int i = 5; i <= sq; i = i + 6)
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        return true;
    }

    static void print_arr(int A[]) {
        for (int i : A) {
            System.out.print(i + " ");
        }
        System.out.println();
    }

    static void print_arr(long A[]) {
        for (long i : A) {
            System.out.print(i + " ");
        }
        System.out.println();
    }

    static void print_arr(char A[]) {
        for (char i : A) {
            System.out.print(i + " ");
        }
        System.out.println();
    }

    static int min(int a, int b) {
        return Math.min(a, b);
    }

    static int min(int a, int b, int c) {
        return Math.min(a, Math.min(b, c));
    }

    static int min(int a, int b, int c, int d) {
        return Math.min(a, Math.min(b, Math.min(c, d)));
    }

    static int max(int a, int b) {
        return Math.max(a, b);
    }

    static int max(int a, int b, int c) {
        return Math.max(a, Math.max(b, c));
    }

    static int max(int a, int b, int c, int d) {
        return Math.max(a, Math.max(b, Math.max(c, d)));
    }

    static long min(long a, long b) {
        return Math.min(a, b);
    }

    static long min(long a, long b, long c) {
        return Math.min(a, Math.min(b, c));
    }

    static long min(long a, long b, long c, long d) {
        return Math.min(a, Math.min(b, Math.min(c, d)));
    }

    static long max(long a, long b) {
        return Math.max(a, b);
    }

    static long max(long a, long b, long c) {
        return Math.max(a, Math.max(b, c));
    }

    static long max(long a, long b, long c, long d) {
        return Math.max(a, Math.max(b, Math.max(c, d)));
    }

    static int max(int A[]) {
        int max = Integer.MIN_VALUE;
        for (int i = 0; i < A.length; i++) {
            max = Math.max(max, A[i]);
        }
        return max;
    }

    static int min(int A[]) {
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < A.length; i++) {
            min = Math.min(min, A[i]);
        }
        return min;
    }

    static long max(long A[]) {
        long max = Long.MIN_VALUE;
        for (int i = 0; i < A.length; i++) {
            max = Math.max(max, A[i]);
        }
        return max;
    }

    static long min(long A[]) {
        long min = Long.MAX_VALUE;
        for (int i = 0; i < A.length; i++) {
            min = Math.min(min, A[i]);
        }
        return min;
    }

    static long sum(int A[]) {
        long sum = 0;
        for (int i : A) {
            sum += i;
        }
        return sum;
    }

    static long sum(long A[]) {
        long sum = 0;
        for (long i : A) {
            sum += i;
        }
        return sum;
    }

    static ArrayList<Integer> sieve(int n) {
        ArrayList<Integer> primes = new ArrayList<>();
        boolean[] isPrime = new boolean[n];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;
        for (int i = 2; i * i <= n; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j < n; j += i) {
                    isPrime[j] = false;
                }
            }
        }
        for (int i = 2; i < n; i++) {
            if (isPrime[i])
                primes.add(i);
        }
        return primes;
    }

    static class Reader {
        BufferedReader br;
        StringTokenizer st;

        Reader() {
            br = new BufferedReader(new InputStreamReader(System.in));
            st = new StringTokenizer("");
        }

        Reader(File f) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(f));
            st = new StringTokenizer("");
        }

        String next() {
            while (!st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                }
            return st.nextToken();
        }

        int ni() {
            return Integer.parseInt(next());
        }

        long nl() {
            return Long.parseLong(next());
        }

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

        int[] nai(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = ni();
            return a;
        }

        long[] nal(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nl();
            return a;
        }
    }

}