#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <iomanip>
using namespace std;
int Compare(const void*elem1,const void*elem2)
{
	return *(int *)elem1 - *(int *)elem2;
}
int main(void)
{
	freopen ("horsea.in","r",stdin);
	freopen ("horsea.out","w",stdout);
	struct Node
{
	bool Flag;
	Node *Next[26];
	Node()
	{
		Flag=false;
		for(int i=0;i<26;i++)
		{
			Next[i]=NULL;
		}
	}
};

int n,s,top;

char c[100],ans[100];

void dfs(Node *p)
{
	int i;
	if(p->Flag)
	{
		s++;
		printf("%s ",ans);
	}
	if(s==8)
	{
		return;
	}
	for(i=0;i<26;i++)
	{
		if(p->Next[i]!=NULL)
		{
			ans[++top]='a'+i;
			dfs(p->Next[i]);
			ans[top--]=0;
			if(s==8)
			{
				return;
			}
		}
	}
}

int main()
{
	freopen("youdao.in","r",stdin);
	freopen("youdao.out","w",stdout);
	int i,j,t,l;
	Node *Head=new Node;
	Node *p=new Node;
	scanf("%d\n",&n);
	for(i=1;i<=n;i++)
	{
		memset(c,0,sizeof(c));
		scanf("%s\n",&c);
		l=strlen(c);
		p=Head;
		for(j=0;j<l;j++)
		{
			t=c[j]-'a';
			if(p->Next[t]==NULL)
			{
				Node *q=new Node;
				p->Next[t]=q;
				q=NULL;
				delete q;
			}
			p=p->Next[t];
		}
		p->Flag=true;
	}
	scanf("%d\n",&n);
	for(i=1;i<=n;i++)
	{
		memset(c,0,sizeof(c));
		scanf("%s\n",&c);
		l=strlen(c);
		p=Head;
		for(j=0;j<l;j++)
		{
			ans[j]=c[j];
			t=c[j]-'a';
			if(p->Next[t]==NULL)
			{
				printf("%s\n",c);
				goto l1;
			}
			p=p->Next[t];
		}
		s=0;
		top=l-1;
		dfs(p);
		printf("\n");
		l1:memset(ans,0,sizeof(ans));
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}