/**
 *  author:   TakeruOkuyama
 *  created:  2020-04-09 14:53:46
**/
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

const int MOD = 1000000007;

int main(){
    int N;
    cin >> N;
    vector<string> S(N), T(N);
    rep(i, N){
        cin >> S[i];
    }
    rep(i, N){
        cin >> T[i];
    }
    rep(i, N){
        //cin >> S[i] >> T[i];
        if(S[i] != T[i]){
            cout << i+1 << endl << S[i] << endl << T[i] << endl;
        }
    }
return 0;}

/**
 * g++ code.cpp
 * ./a.out
 * shift + ctrl + i
**/