#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<algorithm>
#include<vector> 
#include<stack>
using namespace std;
string s[1000],s1,s2;
int ans,p,q,m,n,k,ll,rr;
int main()
{
	freopen("asm_talk.in","r",stdin);
	freopen("asm_talk.out","w",stdout);
	cin>>m;
	for(int i=1;i<=m;i++)
	{
		cin>>p;
		if(p==1)
		{
			k++;
			cin>>s[k];
		}
		else 
		{
			cin>>s1;
			for(int j=1;j<=k;j++)
			   if(s[j]==s1) 
			   {
			   	cout<<"YES"<<endl;
			   	ans++;
			   	break;
			   }
			if(ans==0)
			  for(int j=1;j<=k;j++)
			   if(s[j].size()==s1.size())
			   {
			       for(int k=1;k<=s[j].size();k++)
			              if(s[j][k]!=s1[k]&&s[j][k]!='*'&&s1[k]!='*')
			              {
			              	rr++;
			              	break;
			              }
				   if(rr==0)
				   {
				      cout<<"YES"<<endl;
				      ans++;
				      break;
				   }
				}
			if(ans==0)
			    cout<<"NO"<<endl;
			rr=ans==0;
        }
	}
}