#include "bits/stdc++.h"
#define rep(a,b) for(int a = 0;a < b;a++)
#define REP(i, x, n) for(int i = x; i < n; i++)
#define P(a) cout << a << endl
#define MP(a,b) make_pair(a,b)
#define PB(a) push_back(a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int dx[] = { 1, -1 , 0 , 0 };
int dy[] = { 0,  0,  1, -1 };
ll MOD = 1000000007;

void solve() {
    int n;
    cin >> n;
    vector<string> v;
    rep(i,2*n){
    	string tmp;
	    cin >> tmp;
	    v.push_back(tmp);
    }
    rep(i,n){
    	if(v[i] != v[i+n]){
	       P(i+1);P(v[i]);P(v[i+n]);
	    }
    }
}

int main() {
    solve();
    return 0;
}