#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<vector>
#include<stack>
#include<cmath>
#include<algorithm>
#include<time.h>
using namespace std;
int N;
string a[100001];
bool judge(string x,string a)
{
	if(x.length()==a.length())
	{
		
		for(int i=0;i<x.length();i++)
		{
			if(i==x.length()-1)
			{
				if(x[i]==a[i]||x[i]=='*')
				{
				 cout<<"YES"<<endl;
				 return false;
				}
				else return true;
			} 
			if(x[i]=='*') continue;
			else
			{
				if(x[i]==a[i]) continue;
				else return true;
			}
		}
	}
	else return true;
}
void sovle()
{
	int step=0;
	cin>>N;
	for(int i=1;i<=N;i++)
	{
		int t;
		cin>>t;
		if(t==1)
		{
			step++;
			cin>>a[step];	
		}
		else
		{
			string x;
			cin>>x;
			for(int i=step;i>=1;i--)
			{
				if(i==1)
				{
					if(judge(x,a[i]))
					{
						cout<<"NO"<<endl;
						break;
					}
					else break;
				}
				if(judge(x,a[i])) continue;
				else break;
			}
		}
		
	}
}
int main()
{
	freopen("asm_talk.in","r",stdin);
	freopen("asm_talk.out","w",stdout);
	sovle();
	return 0;
}