#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<string>
#include<cmath>
using namespace std;
string s[100010];
int tot,m;
bool find(string s1)
{
	for (int i=1;i<=tot;i++)
	{
		if (s1.length()==s[i].length())
		{
			int q=1;
			for (int j=0;j<s1.length();j++)
			{
				if (s1[j]!=s[i][j]&&s1[j]!='*'&&s[i][j]!='*')
				q=0;
			}
			if (q) return true;
		}
	}
    return false;
	
}
int main()
{
	freopen("asm_talk.in","r",stdin);
	freopen("asm_talk.out","w",stdout);
	cin>>m;
	for (int i=1;i<=m;i++)
	{
		int x;
		cin>>x;
		string s1;
		cin>>s1;
		if (x==1)
		{
			s[++tot]=s1;
		}
		else 
		{
			if (find(s1))
			 cout<<"YES"<<endl;
			else cout<<"NO"<<endl;
		}
	}
	return 0;
}