#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e4+10;
const int maxm=1e4+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
int trie[maxn][26],fail[maxn],vis[maxn],cnt=0,n;
string s[200],ss;
vector<int> rec;
map<int,string> mp;
void insert(string x){
int now=0;
rep(i,0,x.size()){
int tmp=x[i]-'a';
if(!trie[now][tmp]) trie[now][tmp]=++cnt;
now=trie[now][tmp];
vis[now]=0;
}
rec.push_back(now);
mp[now]=x;
}
queue<int> q;
void bfs(){
while(!q.empty()) q.pop();
rep(i,0,26) if(trie[0][i]){
q.push(trie[0][i]);
fail[trie[0][i]]=0;
}
while(!q.empty()){
int tp=q.front();q.pop();
rep(i,0,26){
if(trie[tp][i]) fail[trie[tp][i]]=trie[fail[tp]][i],q.push(trie[tp][i]);
else trie[tp][i]=trie[fail[tp]][i];
}
}
}
int ans=0;
void query(string x){
int cur=0;
rep(i,0,x.size()){
int tmp=x[i]-'a';
cur=trie[cur][tmp];
for(int j=cur;j;j=fail[j])
vis[j]++;
}
}
int main(){/*
freopen("d://in.txt","r",stdin);
freopen("d://out.txt","w",stdout);*/
while(cin>>n&&n){
ans=cnt=0;
mst(trie,0),rec.clear();
rep(i,0,n){
cin>>s[i];
insert(s[i]);
}
bfs();
cin>>ss;
query(ss);
int maxv=0;
rep(i,0,rec.size()) if(vis[rec[i]]>maxv)
maxv=vis[rec[i]];
cout<<maxv<<"\n";
rep(i,0,rec.size()) if(vis[rec[i]]==maxv)
cout<<mp[rec[i]]<<"\n";
}
return 0;
}