#include<iostream>
#include<set>
#include<array>
using namespace std;
const int n=3;
using Hash=array<int,n>;
const Hash mod={1000000097,1000000087,1000000093};
const Hash B={1198,19285,51616};
Hash Base[1<<20];
Hash operator+(Hash lhs,const Hash&rhs)
{
	for(int i=0;i<n;i++)lhs[i]=(lhs[i]+rhs[i])%mod[i];
	return lhs;
}
Hash operator-(Hash lhs,const Hash&rhs)
{
	for(int i=0;i<n;i++)lhs[i]=(lhs[i]-rhs[i]+mod[i])%mod[i];
	return lhs;
}
Hash operator*(Hash lhs,const int v)
{
	for(int i=0;i<n;i++)lhs[i]=(long)lhs[i]*v%mod[i];
	return lhs;
}
Hash operator*(Hash lhs,const Hash&rhs)
{
	for(int i=0;i<n;i++)lhs[i]=(long)lhs[i]*rhs[i]%mod[i];
	return lhs;
}
int N;
int main()
{
	for(int i=0;i<n;i++)Base[0][i]=1;
	for(int i=1;i<1<<20;i++)Base[i]=Base[i-1]*B;
	cin>>N;
	set<Hash>V;
	for(;N--;)
	{
		string S;cin>>S;
		Hash now{};
		for(int i=0;i<S.size();i++)now=now+Base[i]*S[i];
		bool fn=V.find(now)!=V.end();
		for(int i=1;i<S.size();i++)
		{
			Hash tmp=now;
			tmp=tmp+Base[i-1]*S[i]-Base[i-1]*S[i-1]+Base[i]*S[i-1]-Base[i]*S[i];
			if(V.find(tmp)!=V.end())fn=true;
		}
		cout<<(fn?"Yes\n":"No\n");
		V.insert(now);
	}
}