#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <map>
using namespace std;
const int N = 1000 + 10, S = 100 * 3;
int n, k, j, s, d, c[N];
map<string, int> a, m;
map<string, int>::iterator t;
char As[S], Bs[S], r[S];
string A, B, h[N];
int main() {
    freopen("sakinani.in", "r", stdin);
    freopen("sakinani.out", "w", stdout);
    scanf("%d\n", &n);
    for(int i=0; i<n; i++) {
        scanf("%s %s\n", As, Bs);
        A = As;
        B = Bs;
        if((t = a.find(B)) == a.end()) {
            a[B] = a[A] = ++d;
            h[d] = B;
        } else
            a[A] = t->second;
        //fprintf(stderr, "%s %s %d\n", A.c_str(), B.c_str(), d);
    }
    scanf("%d\n", &k);
    for(int i=0; i<k; i++) {
        scanf("%s\n", As);
        A = As;
        m[A] = 1;
    }
    while(scanf("%s\n", As) == 1) {
        A = As;
        t = a.find(A);
        if(t == a.end())
            continue;
        c[t->second]++;
        if(m.find(A) != m.end())
            c[t->second]++;
    }
    for(int i=1; i<=d; i++) {
        if(c[i] > s)
            s = c[i], j = i;
        //fprintf(stderr, "%s %d\n", h[i].c_str(), c[i]);
    }
    printf("%s\n", h[j].c_str());
    return 0;
}