#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--)
#define p(s) cout<<(s)<<endl
#define DEBUG(x,y) cout<<#x<<": "<<x<<" , "<<#y<<": "<<y<<endl;
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9;

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