You are given a string s, consisting of n letters, each letter is either 'a' or 'b'. The letters in the string are numbered from 1 to n.

s[l; r] is a continuous substring of letters from index l to r of the string inclusive. 

A string is called balanced if the number of letters 'a' in it is equal to the number of letters 'b'. For example, strings "baba" and "aabbab" are balanced and strings "aaab" and "b" are not.

Find any non-empty balanced substring s[l; r] of string s. Print its l and r (1 ≤ l ≤ r ≤ n). If there is no such substring, then print -1 -1.

Input

The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of testcases.

Then the descriptions of t testcases follow.

The first line of the testcase contains a single integer n (1 ≤ n ≤ 50) — the length of the string.

The second line of the testcase contains a string s, consisting of n letters, each letter is either 'a' or 'b'.

Output

For each testcase print two integers. If there exists a non-empty balanced substring s[l; r], then print l r (1 ≤ l ≤ r ≤ n). Otherwise, print -1 -1.

Example

Input


4
1
a
6
abbaba
6
abbaba
9
babbabbaa


Output


-1 -1
1 6
3 6
2 5

Note

In the first testcase there are no non-empty balanced subtrings.

In the second and third testcases there are multiple balanced substrings, including the entire string "abbaba" and substring "baba".
import java.io.*;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Task {
    FastScanner scanner;
    PrintWriter writer;

    public final String INPUT_FILE_NAME = "input.txt";
    public final String OUTPUT_FILE_NAME = "output.txt";
    public final static Double EPS = 0.0000001;

    public void run() {
        try {
            writer = new PrintWriter(System.out);//new PrintWriter(new File(OUTPUT_FILE_NAME));
            scanner = new FastScanner(System.in);//new FastScanner(new File(INPUT_FILE_NAME));

            solution();

            writer.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class FastScanner {
        BufferedReader reader;

        StringTokenizer tokenizer;
        FastScanner(File file) throws FileNotFoundException {
            reader = new BufferedReader(new InputStreamReader(new FileInputStream(file)));
        }

        FastScanner(InputStream is) {
            reader = new BufferedReader(new InputStreamReader(is));
        }

        boolean hasNext() {
            boolean result = false;
            if (tokenizer != null && tokenizer.hasMoreTokens()) {
                result =  true;
            } else {
                String newLine = null;
                try {
                    newLine = reader.readLine();
                    while(newLine != null) {
                        newLine = newLine.trim();
                        if (!newLine.equals("")) {
                            break;
                        }
                    }
                } catch (IOException e) {
                    e.printStackTrace();
                }

                if (newLine != null) {
                    result = true;
                    tokenizer = new StringTokenizer(newLine);
                }
            }

            return result;
        }

        String next() {
            hasNext();
            return tokenizer.nextToken();
        }

        String nextLine() {
            String result = "";
            try {
                result = reader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return result;
        }

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

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

    public int[] readIntArray(int n) {
        int[] result = new int[n];
        for (int i = 0; i < n; ++i) {
            result[i] = scanner.nextInt();
        }
        return result;
    }

    public static void main(String[] args) {
        new Task().run();
    }

    public void solution() throws IOException {
        int t = scanner.nextInt();

        for (int i = 0; i < t; ++i) {
            solution2();
        }
    }

    public void solution2() {
        int n = scanner.nextInt();
        String s = scanner.nextLine();
        for (int i = 0; i < s.length() - 1; ++i) {
            if ((s.charAt(i) == 'a' && s.charAt(i+1) == 'b') ||
                    (s.charAt(i) == 'b' && s.charAt(i+1) == 'a'))
            {
                writer.println((i+1) + " " + (i + 2));
                return;
            }
        }
        writer.println("-1 -1");
    }

}
