#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
static const int base1 = 1007, base2 = 2009;
static const int mod1 = 1000000007, mod2 = 1000000009;
ll safemod(ll a,ll m){
    return (a%m+m)%m;
}
int main(){
    ll m=1e6+10;
    vl power1(m,1),power2(m,1);
    rep(i,m-1){
        power1[i+1]=power1[i]*base1%mod1;
        power2[i+1]=power2[i]*base2%mod2;
    }
    set<pl> st;
    ll n;cin >> n;
    while(n--){
        string s;cin >> s;
        ll p=s.size();
        pl q={0,0};
        rep(i,p){
            q.first=(q.first+power1[i]*s[i])%mod1;
            q.second=(q.second+power2[i]*s[i])%mod2;
        }
        bool ok=st.count(q);
        rep(i,p-1){
            pl f=q;
            f.first-=power1[i]*s[i];
            f.first-=power1[i+1]*s[i+1];
            f.second-=power2[i]*s[i];
            f.second-=power2[i+1]*s[i+1];
            f.first+=power1[i]*s[i+1];
            f.first+=power1[i+1]*s[i];
            f.second+=power2[i+1]*s[i];
            f.second+=power2[i]*s[i+1];
            f.first=safemod(f.first,mod1);
            f.second=safemod(f.second,mod2);
            ok|=st.count(f);
        }
        st.insert(q);
        cout << (ok? "Yes":"No") << endl;
    }

}