#include<iostream>
#include<set>
using namespace std;
const int mod=1000000097;
long base[1<<20];
int N;
int main()
{
	base[0]=1;
	for(int i=1;i<1<<20;i++)base[i]=base[i-1]*3%mod;
	cin>>N;
	set<int>V;
	for(;N--;)
	{
		string S;cin>>S;
		int now=0;
		for(int i=0;i<S.size();i++)now=(now+base[i]*S[i])%mod;
		bool fn=V.find(now)!=V.end();
		for(int i=1;i<S.size();i++)
		{
			int tmp=now;
			tmp=(tmp-base[i-1]*S[i-1])%mod;
			tmp=(tmp-base[i]*S[i])%mod;
			tmp=(tmp+base[i-1]*S[i])%mod;
			tmp=(tmp+base[i]*S[i-1])%mod;
			if(V.find((tmp+mod)%mod)!=V.end())fn=true;
		}
		cout<<(fn?"Yes\n":"No\n");
		V.insert(now);
	}
}