#include<fstream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<list>

using namespace std;
ifstream fi("sakinani.in");
ofstream fo("sakinani.out");

string k;
struct P
{
	string name;
	string school;
	bool magic;
	int czg;
	
	void init()
	{
		magic=0;
		czg=0;
	}
	void appear(string k)
	{
		if(k==name)
			if(magic)
				czg+=2;
			else
				czg++;
	}
	void go_magic(string k)
	{
		if(k==name)
			magic=true;
	}
	void school_union(P p)
	{
		if(p.school==school)
		{
			p.school=k;
			czg+=p.czg;
			p.czg=0;
		}
	}
}people[201];
int main()
{
	int n,k;
	fi>>n;
	for(int i=0;i<n;i++)
		fi>>people[i].name>>people[i].school;
	fi>>k;
	string temp;
	for(int i=0;i<k;i++)
	{
		fi>>temp;
		for(int j=0;j<n;j++)
			people[j].go_magic(temp);
	}
	while(fi.peek()!=EOF)
	{
		fi>>temp;
		for(int i=0;i<n;i++)
			people[i].appear(temp);
	}
	for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++)
			people[i].school_union(people[j]);
	int max=0,maxi;;
	string ans;
	for(int i=0;i<n;i++)
	{
		if(people[i].czg>max)
		{
			ans=people[i].school;
			maxi=i;
			max=people[i].czg;
		}
		else
			if(people[i].czg==max&&people[i].school<people[maxi].school)
			{
				ans=people[i].school;
				maxi=i;
			}
	}
	fo<<ans;
	fi.close();
	fo.close();
	return 0;
}