#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;const int maxn=200000+10;int wa[maxn],wb[maxn],wv[maxn],wss[maxn],rak[maxn];
int cmp(int *r,int a,int b,int l)
{return r[a]==r[b]&&r[a+l]==r[b+l];
}
void da(int *r,int *sa,int n,int m)
{int i,j,p,*x=wa,*y=wb,*t;for(i=0; i<m; i++) wss[i]=0;for(i=0; i<n; i++) wss[x[i]=r[i]]++;for(i=1; i<m; i++) wss[i]+=wss[i-1];for(i=n-1; i>=0; i--) sa[--wss[x[i]]]=i;for(j=1,p=1; p<n; j*=2,m=p){for(p=0,i=n-j; i<n; i++) y[p++]=i;for(i=0; i<n; i++) if(sa[i]>=j) y[p++]=sa[i]-j;for(i=0; i<n; i++) wv[i]=x[y[i]];for(i=0; i<m; i++) wss[i]=0;for(i=0; i<n; i++) wss[wv[i]]++;for(i=1; i<m; i++) wss[i]+=wss[i-1];for(i=n-1; i>=0; i--) sa[--wss[wv[i]]]=y[i];for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1; i<n; i++)x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;}return ;
}char s[2*maxn],rev[2*maxn];
int sa[maxn],r[maxn],height[maxn];
int n;
int p0,p1;
void build_height(int n)
{int i,k=0;for(i=0; i<n; i++)rak[sa[i]]=i;for(i=0; i<n; i++){if(k)k--;int j=sa[rak[i]-1];while(s[i+k]==s[j+k])k++;height[rak[i]]=k;}
}void solve(int x)
{if(!x){int t = 0;memset(sa,0,sizeof(sa));for(int i = 0; i < n; i++)r[t++]=s[i]-'a'+1;r[t++] = 0;da(r,sa,t,30);p0 = sa[t-1]+1;}else{int t = 0;memset(sa,0,sizeof(sa));for(int i = 0; i < n; i++)r[t++]=rev[i]-'a'+1;r[t++] = 0;da(r,sa,t,30);build_height(t);int k = t-2;while(k>=4&&height[k]&&height[k]==n-sa[k-1])k--;p1 = sa[k];}
}int cmp(char*s,char*t,int p,int q)
{for(int i=0; i<n; i++)if(s[(p+i)%n]!=t[(q+i)%n])return s[(p+i)%n]>t[(q+i)%n];return 2;
}int main()
{int T;scanf("%d",&T);while(T--){scanf("%d",&n);scanf("%s",s);for(int i = 0; i < n; i++)s[n+i] = s[i];n = 2*n;for(int i=0; i<n; i++)rev[i]=s[n-1-i];solve(0);solve(1);int ans,dir;int tmp = p1;// printf("%d %d\n",p0,tmp);p1 = n-p1;n/=2;int d=cmp(s,rev,p0-1,tmp);//printf("%d %d\n",p0,tmp);if(d==2){if(p0<=p1)ans=p0,dir=0; else ans=p1,dir=1;}else if(d>0)ans=p0,dir=0;else ans=p1,dir=1;printf("%d %d\n",ans,dir);}return 0;
}