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

public class a{
  static final int mod = 1000000007;

  static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

  static void parr(int []arr) throws Exception{
    for(int i : arr) System.out.print(i+" ");
    System.out.println();
  }
  static void parr(long []arr) throws Exception{
    for(long i : arr) System.out.print(i+" ");
    System.out.println();
  }
  static void parr(double []arr) throws Exception{
    for(double i : arr) System.out.print(i+" ");
    System.out.println();
  }
  static void parr(float []arr) throws Exception{
    for(float i : arr) System.out.print(i+" ");
    System.out.println();
  }

  static int inpi() throws Exception{
    return (int)(Integer.parseInt(br.readLine()));
  }
  static long inpl() throws Exception{
    return (long)Long.parseLong(br.readLine());
  }
  static double inpd() throws Exception{
    return (double)Double.parseDouble(br.readLine());
  }
  static float inpf() throws Exception{
    return (float)Float.parseFloat(br.readLine());
  }

  static int[] inpai() throws Exception{
    String ar[] = br.readLine().split(" ");
    int n = ar.length;
    int arr[] = new int[n];
    int k=0;
    for(String i : ar) arr[k++] = (int)(Integer.parseInt(i));
    return arr;
  }

  static double[] inpad() throws Exception{
    String ar[] = br.readLine().split(" ");
    int n = ar.length;
    double arr[] = new double[n];
    int k=0;
    for(String i : ar) arr[k++] = (double)(Double.parseDouble(i));
    return arr;
  }

  static float[] inpaf() throws Exception{
    String ar[] = br.readLine().split(" ");
          int n = ar.length;
    float arr[] = new float[n];
    int k=0;
    for(String i : ar) arr[k++] = (float)(Float.parseFloat(i));
    return arr;
  }

  static long[] inpal() throws Exception{
    String ar[] = br.readLine().split(" ");
          int n = ar.length;
    long arr[] = new long[n];
    int k=0;
    for(String i : ar) arr[k++] = (long)(Long.parseLong(i));
    return arr;
  }
///////

///////////
static boolean isPrime(int num){

  int sqrt = (int)Math.sqrt(num);
//  System.out.println(num);
  for(long i=2;i<=sqrt;i++){
    if(num%i==0){
      return false;
    }
  }
  return true;
}
/////////////
static long gcd (long a,long b){
if(b==0) return a;
return gcd(b,a%b);
}
//////

static class sort implements Comparator<node>{
  public int compare(node a,node b){
    if(a.x>b.x) return 1;
    return -1;
  }
}


static class node{
    long x;
    long y;
    node(long x,long y){
      this.x = x;
      this.y = y;
    //  this.dis = dis;
    }
}
//////
static void solve() throws Exception{
  int n = inpi();
  String str = br.readLine();
  int in = str.indexOf("ab");
  int in2 = str.indexOf("ba");

  if(in==-1 && in2==-1){
    System.out.println("-1 -1");
    return;
  }
  if(in!=-1)
  System.out.println(in+1+" "+(in+2));
  else
  System.out.println(in2+1+" "+(in2+2));
 }
//////

static int dp[];
static Map<Integer,List<Integer>> map;
static List<Integer> lis;
static int n,k,z,m,x,y;
static ArrayList<Long>mat[];
/////
  public static void main(String[] args)throws Exception{
    int test=1;
    test = inpi();

    for(int z=1;z<=test;z++){
        solve();
    }
//////
  }
}
