#include <bits/stdc++.h>
using namespace std;
 
const int MAXN=100,MAXL=1350000+5,SIZE=52;
bool found[MAXN];
int n,idx[256];
char s[MAXL];
struct Node{
    Node *p,*s[SIZE],*las;
    int exist;
    Node():p(0x0),las(0x0),exist(0) {memset(s,0,sizeof 0);}
}*ac=new Node;
 
void Insert(int id){
    int n=strlen(s);
    //cout<<n<<endl;
    Node *p=ac;
    for(int i=0;i<n;i++){
        int c=idx[s[i]];
        if(!p->s[c]) p->s[c]=new Node();
        p=p->s[c];
    }
    p->exist=id;
}void Build(){
    queue<Node*> q;
    for(int i=0;i<SIZE;i++)
        if(ac->s[i]) ac->s[i]->p=ac,q.push(ac->s[i]);
        else ac->s[i]=ac;
    while(!q.empty()){
        Node *p=q.front();q.pop();
        for(int i=0;i<SIZE;i++){
            if(!p->s[i]) {p->s[i]=p->p->s[i];continue;}
            p->s[i]->p=p->p->s[i];
            q.push(p->s[i]);
            p->las=p->p->exist?p->p:p->p->las;
        }
    }
}void Up(Node *p){
    if(!p) return;
    found[p->exist]=1;
    Up(p->las);
}void Find(){
    int n=strlen(s)-1;
    Node *p=ac;
    for(int i=0;i<n;i++){
        p=p->s[i];
        if(p->exist) Up(p);
        else if(p->las) Up(p->las);
    }
}
 
void Init(){
    cin>>n;
    for(int i='a';i<='z';i++) idx[i]=i-'a';
    for(int i='A';i<='Z';i++) idx[i]=i-'A'+26;
    for(int i=0;i<n;i++) scanf("%s",s),Insert(i+1);
    Build();
}int main(){
#ifdef bhiaibogf
    freopen("in.in","r",stdin);
#else
    freopen("lettera.in","r",stdin);
    freopen("lettera.out","w",stdout);
#endif
    Init();
    while(scanf("%s",s)){
        memset(found,0,sizeof found);
        Find();
        bool flag=1;
        for(int i=1;i<=n;i++) if(!found[i]) flag=0;
        puts(flag?"Yes":"No");
    }
    return 0;
}