#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <map>
#include <set>
using namespace std;

int main(void){
    int n;
    int ans;
    string s1[20], s2[20];
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> s1[i];
    }
    for(int i=0;i<n;i++){
        cin >> s2[i];
    }
    
    for(int i=0;i<n;i++){
        if(s1[i].length() != s2[i].length()){
            ans = i;
        }else{
            for(int j=0;j<s1[i].length();j++){
                if(s1[i][j] != s2[i][j]){
                    ans = i;
                }
            }
        }
    }
    cout << ans+1 << endl;
    cout << s1[ans] << endl;
    cout << s2[ans] << endl;
    return 0;
}