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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class BalancedString {

	//2d arraylist adj list
	//ArrayList<ArrayList<Integer>> adj = new ArrayList<ArrayList<Integer>>();
	//for (int i = 0; i < n; i++)adj.add(new ArrayList<Integer>());
	/*
	 -Binary search
	 int lo = 0;
	 int hi = highest val possible;
	 while (lo <= hi){
	 int mid = (lo+hi)/2;
	 
	 if (check){
	 
	 	}else {
	 	
	 	}
	 }
	 */
		
		
		
	//Custom Comparators
	/*
	 //ArrayList<comp> a = new ArrayList<comp>();
	 //long [] a = new new long [n];
	 
	 class comp implements Comparable<comp> {

		public int a, b;

		public comp(int a, int b) {
			this.a = a;
			this.b = b;
		}

		public int compareTo(comp other) {
		//sort by 1 criteria
		 //return Integer.compare(this.a. other.a);
		  
		  //sort by 2 criteria
			//if (this.a != other.a) {
			//	return Integer.compare(this.a, other.a);
			//} else {
				return Integer.compare(other.b, this.b);
			//}
		}
	}
	 */
		
		
		
	//MultiSet
	/*
	 static void add(int x){
		if(multiset.containsKey(x)){
			multiset.put(x, multiset.get(x) + 1);
		} else {
			multiset.put(x, 1);
		}
	}

	static void remove(int x){
		multiset.put(x, multiset.get(x) - 1);
		if(multiset.get(x) == 0){
			multiset.remove(x);
		}
	}
	 */
	 
		
	//DFS and other related items
	//ArrayList<ArrayList<Integer>> adj = new ArrayList<ArrayList<Integer>>();
	//for (int i = 0; i < n; i++)adj.add(new ArrayList<Integer>());
	//boolean [] visited = new boolean [n];
	/*
	 static void dfs(int node) {
			if (visited[node]) return;
			
			nodes++;
			visited[node] = true;
			for (int neighbor : adj.get(node)) {
				dfs(neighbor);
			}
	 */
	 

		
	//Floodfill
	/*
	 static void floodfill(int r, int c, char curC) {
		if (r < x || r >= 0 || c < y || c >= 0) {
			return;
		} 
		if(visited[r][c] || grid[r][c] != curC) {
			return;
		}
		visited[r][c] = true;
		size++;
		
		floodfill(r+1, c, curC);
		floodfill(r-1, c, curC);
		floodfill(r, c+1, curC);
		floodfill(r, c-1, curC);
	}
	 */
		
		
	//2 pointers
	/*
	 int l = 0, r = 0, cur = 0, ans = 0;
			while (l < n && r < n) {
				while (r < n) {
					r++;
					if ((check condition)) {
						r--;
						break;
					}
				}

				l++;
			}
	 */
		
		
	//mod int template
		/*static int mod(int a, int m)
	{
	    return (a%m + m) % m;
	}*/
		
		
		static class FastReader {
	        BufferedReader br;
	        StringTokenizer st;
	 
	        public FastReader()
	        {
	            br = new BufferedReader(
	                new InputStreamReader(System.in));
	        }
	 
	        String next()
	        {
	            while (st == null || !st.hasMoreElements()) {
	                try {
	                    st = new StringTokenizer(br.readLine());
	                }
	                catch (IOException e) {
	                    e.printStackTrace();
	                }
	            }
	            return st.nextToken();
	        }
	 
	        int nextInt() { return Integer.parseInt(next()); }
	 
	        long nextLong() { return Long.parseLong(next()); }
	 
	        double nextDouble()
	        {
	            return Double.parseDouble(next());
	        }
	 
	        String nextLine()
	        {
	            String str = "";
	            try {
	                str = br.readLine();
	            }
	            catch (IOException e) {
	                e.printStackTrace();
	            }
	            return str;
	        }
	    }
		
		
		
		public static void main(String[] args) throws IOException {
			PrintWriter out = new PrintWriter(System.out);
			FastReader in = new FastReader();
			 int t = in.nextInt();

			 for (int ie = 0; ie < t; ie++) {
			 int n = in.nextInt();
			 
			 String s = in.next();
			 if (!s.contains("a") || !s.contains("b")) {
				 out.println(-1+" "+-1);
				 continue;
			 }
			 for (int i = 0; i < n-1; i++) {
				if (s.charAt(i) == 'a' && s.charAt(i+1) == 'b') {
					out.println((i+1)+" "+(i+2));
					break;
				}
				if (s.charAt(i) == 'b' && s.charAt(i+1) == 'a') {
					out.println((i+1)+" "+(i+2));
					break;
				}
				 
			 }
			 
			 
			 
			 }
			 out.close();

	}

}
