#include <bits/stdc++.h>

using namespace std;

const int N = 1e3+;

int n;

int cnt, tot;

map<string ,int> mp;

string s[N];

vector<int> son[N], fa[N];

string s1, s2;

int getId(string str)

{

    if(mp[str]) {

        return mp[str];

    }

    mp[str] = (++cnt);

    s[cnt] = str;

    return cnt;

}

int dfs(int u, int v) {

    if(u == v) return true;

    for(int i=; i<son[u].size(); i++) {

        int x = son[u][i];

        //cout << s[x] <<" ";

        if(dfs(son[u][i], v)) {

            return true;

        }

    }

    //cout<<"\n";

    return false;

}

int main()

{

    freopen("in.txt","r",stdin);

    scanf("%d", &n);

    for(int i=; i<=n; i++) {

        cin >> s1 >> s2;

        int u = getId(s1);

        int v = getId(s2);

        son[u].push_back(v);

        fa[v].push_back(u);

    }

    int m; scanf("%d",&m);

    while(m--) {

        cin >> s1 >> s2;

        int u = getId(s1);

        int v = getId(s2);

        // cout <<u <<" "<< v<<"\n";

        bool flag=;

        queue<int> que;

        que.push(u);

        while(!que.empty()) {

            int tmp=que.front(); que.pop();

            //cout << s[tmp]<<"\n";

            for(int i=; i<fa[tmp].size(); i++) {

                que.push(fa[tmp][i]);

            }

            if(dfs(tmp,v)) {

                flag = true;

                cout << s[tmp] <<endl;

                break;

            }

        }

        if(!flag)

            puts("-1");

    }

    return ;

}