t = int(input())
for i in range(t):
n = int(input())
s = input()
if s <= s[::-1]:
print(s)
else :
print(s[::-1] + s)
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
map<int,int>m1,m2;
vector<int>a(n),dl(n),dr(n);
for(int i=0;i<n;i++)cin>>a[i];
int pos=0;
for(int i=0;i<n;i++){
m1[a[i]]++;
while(m1[pos])pos++;
dl[i]=pos;
}
pos=0;
for(int i=n-1;i>0;i--){
m2[a[i]]++;
while(m2[pos])pos++;
dr[i-1]=pos;
}
for(int i=0;i<n-1;i++){
if(dl[i]==dr[i]){
cout<<2<<endl;
cout<<1<<' '<<i+1<<endl<<i+2<<' '<<n<<endl;
return ;
}
}
cout<<-1<<endl;
}
int main(){
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int t;
cin>>t;
//t=1;
while(t--)solve();
return 0;
}