#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
using namespace std;
const int maxnode=10009*100;
int ch[maxnode][26],val[maxnode];
int tot=0;
inline int base(const char &a){
	if(a>='a'&&a<='z')return a-'a';
	return a-'A';
}
inline void insert(const char *str,const int &v){
	int u=0;
	for(int i=0;str[i];++i){
		if(!ch[u][base(str[i])])ch[u][base(str[i])]=++tot;
		u=ch[u][base(str[i])];
	}
	val[u]=v;
}
inline int query(const char *str){
	int u=0;
	for(int i=0;str[i];++i){
		if(!ch[u][base(str[i])])return 0;
		u=ch[u][base(str[i])];
	}
	return val[u];
}
int main(){
	#define submit
	#ifdef submit
	freopen("scanword.in","r",stdin);
	freopen("scanword.out","w",stdout);
	#endif
	int n,tmp;
	char str[110];
	scanf("%d",&n);
	while(n--){
		scanf("%s%d",str,&tmp);
		insert(str,tmp);
	}
	scanf("%d",&n);
	while(n--){
		scanf("%s",str);
		printf("%d\n",query(str));
	}
	#ifdef submit
	fclose(stdin);
	fclose(stdout);
	#else
	system("pause");
	#endif
	return 0;
}