#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	vector<ll> M={100'000'009,100'000'007,998244353,998244341};
	set<array<ll,4>> s;
	int N;
	cin>>N;
	ll D=100;
	ll L=1'000'100;
	vector<vector<ll>> fact(4,vector<ll>(L,1));
	rep(j,4) rep(i,L-1) fact[j][i+1]=(fact[j][i]*D)%M[j];
	rep(roop,N){
		string S;
		cin>>S;
		array<ll,4> tmp={0,0,0,0};
		for(int i=0;i<(int)(S.size());i++){
			rep(j,4){
				tmp[j]=(tmp[j]+fact[j][i]*(S[i]-'a'))%M[j];
			}
		}
		bool J=(s.count(tmp));
		for(int i=0;i<(int)(S.size())-1;i++){
			array<ll,4> X;
			ll diff=(1-D)*(ll)(S[i+1]-S[i]);
			rep(j,4){
				X[j]=(tmp[j]+(diff*fact[j][i])%M[j]+M[j])%M[j];
			}
			if(s.count(X)) J=1;
		}
		yneos(J);
		s.insert(tmp);
	}
}