#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL <<62);
constexpr int INF = (1<<30);
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    const ll p = 1e9+7, q = 1e9+9;
    const ll a = 10000019, b = 99999989;
    vector<ll> hp(1e6+1), hq(1e6+1), k(26);
    rep(i,26) k[i] = rand();
    hp[0] = hq[0] = 1;
    rep(i,1e6) hp[i+1] = hp[i] * a % p, hq[i+1] = hq[i] * b % q;
    set<ll> se;
    rep(i,n){
        string s;
        cin >> s;
        int m = s.size();
        ll resp = 0, resq = 0;
        rep(j,m){
            resp = (resp + k[s[j]-'a'] * hp[m-j]) % p;
            resq = (resq + k[s[j]-'a'] * hq[m-j]) % q;
        }
        bool ans = se.count(resp * resq);
        rep(j,m-1){
            ll y = resp - k[s[j]-'a'] * hp[m-j] - k[s[j+1]-'a'] * hp[m-(j+1)] + k[s[j]-'a'] * hp[m-(j+1)] + k[s[j+1]-'a'] * hp[m-j];
            ll z = resq - k[s[j]-'a'] * hq[m-j] - k[s[j+1]-'a'] * hq[m-(j+1)] + k[s[j]-'a'] * hq[m-(j+1)] + k[s[j+1]-'a'] * hq[m-j];
            y = (y % p + p) % p;
            z = (z % q + q) % q;
            ans = ans + se.count(y*z);
        }
        se.insert(resp * resq);
        cout << (ans?"Yes\n":"No\n");
    }
    return 0;
}