ACcode:
#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
char a[105],b[105],s[105+105],c[105+105];
int main(){
int loop,n,cnt=1;
scanf("%d",&loop);
while(loop--){
scanf("%d",&n);
scanf("%s",a+1);
scanf("%s",b+1);
scanf("%s",s+1);
int flag=1,ans;
for(int i=1;i<=2*n&&flag;++i){
int j,k;
for(j=1,k=1;j<=n;++j,k+=2){
c[k]=b[j];
c[k+1]=a[j];
}
int f=1;
for(int j=1;j<=2*n&&f;++j)
if(s[j]!=c[j])f=0;
if(f)flag=0,ans=i;
for(int j=1;j<=n;++j)a[j]=c[j],b[j]=c[j+n];
}
if(flag)printf("%d %d\n",cnt++,-1);
else printf("%d %d\n",cnt++,ans);
}
return 0;
}