#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1)); 
int n;
string s[15],w[15];

int main(){
	cin >> n;
	REP(i,0,n) cin >> s[i];
	REP(i,0,n) cin >> w[i];
	REP(i,0,n) if(s[i]!=w[i]){cout << i+1 << endl << s[i] << endl << w[i] << endl; return 0;}
	
	return 0;
}