#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<string>
#include<string.h>
#include<vector>
#include<queue>
#include<cmath>
#include<iostream>
using namespace std;
string a[100005],a1[100005];
int m,n,k=-1,ans,p,tot=1;
int main()
{
	freopen("asm_talk.in","r",stdin);
	freopen("asm_talk.out","w",stdout);
	cin>>m;
	for(int i=1;i<=m;i++)
	{
		string b;
		cin>>p;
		if(p==1){
			cin>>b;
			a[tot]=b;
			tot++;
		}
		if(p==2)
		{
			cin>>b;
			int len=b.size();
			for(int i=0;i<len;i++)
			if(b[i]=='*'){
			k=i;
			}
			int i=1;
			if(k==-1)
			while(i<=tot-1){
				if(a[i]==b)
			   {cout<<"YES"<<endl;break;}
				else i++;
				if(i==tot){cout<<"NO"<<endl;break;}
			}
				if(k!=-1)
				{
					i=1;
					while(i<=tot-1){
					if(a[i].size()>=len)b[k]=a[i][k];
						if(a[i]==b)
			    	   {cout<<"YES"<<endl;break;}
			    	   else i++;
		    		   if(i==tot){cout<<"NO"<<endl;break;}
			    	}
				}
		}
	}
	return 0;
}