#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

ll MOD=698468298355739;

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  random_device rd;
  mt19937_64 rnd(rd());    
  uniform_int_distribution<ll> dist_n(100000001,99999999999999);
  
  int n;
  cin>>n;
  vector<string> S(n);
  rep(i,n) cin>>S[i];
  
  vector<ll> A(n);
  rep(i,n){
    ll a=dist_n(rnd);
    A[i]=a;
  }
  
  set<ll> s;
  rep(i,n){
    ll sum=0;
    int k=S[i].size();
    rep(j,k) sum=(sum+A[j]*S[i][j])%MOD;
    if(s.count(sum)) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    s.insert(sum);
    rep(j,k-1){
      s.insert((sum-A[j]*S[i][j]-A[j+1]*S[i][j+1]+A[j]*S[i][j+1]+A[j+1]*S[i][j]+2*MOD)%MOD);
    }
  }

  return 0;
}