#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<cstring>
#include<string>
#include<cstdlib>
using namespace std;
int n,place[21];
char a[21][100010][21];
int main()
{
	freopen("asm_talk.in", "r", stdin);
	freopen("asm_talk.out", "w", stdout); 
	cin>>n;
//	cout<<n;
	int lb,k;
	char b[21];
	for(int i=1;i<=n;i++)
	{
	//	cout<<i<<endl;
		cin>>k;
	
		memset(b,0,sizeof(b));
		cin>>b;
		lb=strlen(b);
		if(k==1)
		{
		
		for(int j=0;j<lb;j++)
		{
			a[lb][place[lb]][j]=b[j];
		}
		place[lb]++;
        }
        else{
        	//	cout<<"asdyuagyud";
        	if(place[lb]==0) cout<<"NO"<<endl;
        	int ok=1;
        	for(int q=0;q<place[lb];q++)//q 个数 e 位置 
        	{
        		
        		for(int e=0;e<lb;e++)
        		{
        			if(b[e]=='*') continue;
        			if(b[e]!=a[lb][q][e])
        			{
        				ok=0;
        				break;
					}
				}
				if(ok) {
					cout<<"YES"<<endl;
					break;
				} 
			}
			if(ok==0) cout<<"NO"<<endl;
        	
		}
		
	}
	return 0;
}/*
6
1 ab
2 ab*
1 abc
1 adc
2 *d
2 abc
*/