G

#include <iostream>
#include <algorithm>
#include <string>
#include <map>
using namespace std;

map<string,int>q;

int main(){
    int t;
    cin >> t;
    int cnt = 0;
    while(t--){
        cnt++;
        int n;
        cin >> n;
        string s1,s2,s3;
        cin >> s1 >> s2 >> s3;
        string ss;
        int ans = 0;
        while(1){
            ans++;
            ss ="";
            for(int i = 0;i < n;i++){
                ss = ss + s2[i] + s1[i];
            }
            if(ss == s3){
                break;
            }
            else if(q[ss] == 1){
                ans = -1;
                break;
            }
            else{
                q[ss] = 1;
                s1 = ss.substr(0,n);
                s2 = ss.substr(n,n+n);
            }
        }
        cout << cnt << " " << ans << endl;
    }
    return 0;
}