#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair< int, int >;

int main() {
    int n;
    cin >> n;
    vector<string> t(n), s(n);
    rep(i, n) cin >>t[i];
    rep(i, n) cin >> s[i];

    rep(i, n) {
        if (t[i] != s[i]) {
            cout << i+1 << endl;
            cout << t[i] << endl << s[i] << endl;
            return 0;
        }
    }
}