/*
string t[10010],c[10100],d[10100],e1[10100],w1[10010],e2[10100],w2[10100];;
int m,n[10010],i;
int main()
{
	char q='*';
	ios::sync_with_stdio(false);
	freopen("asm_talk.in","r",stdin);
	//freopen("asm_talk.out","w",stdout);
	cin>>m;
	for(i=1;i<=m;i++)cin>>n[i]>>t[i];
	for(i=1;i<=m;i++)
	{
	if(n[i]=1)cin>>c[i];
	else 
		cin>>d[i];
	}
	for(i=1;i<=m;i++)
	{
		if(c[i].length()==d[i].length())
		{
			if(c[i]==d[i])  
		       {
				  int f=d[i].find_first_of(q,0);
				  e1[i]=c[i].substr(0,f);
				  w1[i]=c[i].substr(f,c[i].length());
				  e2[i]=d[i].substr(0,f);
				  w2[i]=d[i].substr(f,d[i].length());
				  if(e1==e2&&w1==w2)
					  cout<<"YES"<<endl;
				  else cout<<"NO"<<endl;
			   }
			   else cout<<"NO"<<endl;
		}
		return 0;
	}
				  
				   
			   
	
}	*/

#include<iostream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cctype>
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<vector>
#include<deque>
#include<queue>
#include<iomanip>
#define MAXN 10010
using namespace std;
string str;
bool flag=false;
set<string> s;
char ch;
int i,n,j,q,sub=1;
int main()
{
	int m,n;
	ios::sync_with_stdio(false);
	freopen("asm_talk.in","r",stdin);
    freopen("asm_talk.out","w",stdout);
    cin>>m;
    for(int i = 0; i < m; i++){
    cin>>n>>str;
    if(n==1) s.insert(str);
    else 
	{
      int pos = str.find('*');
     
      if(pos!=-1)
	  {
	for(ch='a';ch<='z';ch++)
	{
	str[pos]=ch;
	if(s.count(str))
{
	flag=true;
	break;
}
}
}else if(s.count(str)) flag=true;
if(flag)
	{
		cout<<"YES"<<endl;
}		
else 
	{
		cout<<"NO"<<endl;
}
}
  }
  return 0;
}