#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;
using mint1 = atcoder::modint1000000007;
int p = 10007;
const int N = 1000000;

mint pw[N+1];
mint1 pw1[N+1];

void init(){
    pw[0] = 1;
    pw1[0] = 1;
    for(int i = 1; i <= N; i++) pw[i] = pw[i-1]*p;
    for(int i = 1; i <= N; i++) pw1[i] = pw1[i-1]*p;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int n; cin >> n;
    set<int> st;
    set<int> st1;
    for(int i = 0; i < n; i++){
        string s; cin >> s;
        mint h = 0;
        mint1 h1 = 0;
        int m = s.size();
        for(int j = 0; j < m; j++){
            h += pw[j]*(s[j]-'a'+1);
            h1 += pw1[j]*(s[j]-'a'+1);
        }
        bool ok = false;
        if(st.count(h.val()) > 0 && st1.count(h1.val())){
            ok = true;
        }else{
            for(int j = 0; j+1 < m; j++){
                mint new_h = h;
                new_h += pw[j]*((s[j+1]-'a'+1)-(s[j]-'a'+1));
                new_h += pw[j+1]*((s[j]-'a'+1)-(s[j+1]-'a'+1));
                if(st.count(new_h.val()) == 0){
                    continue;
                }
                mint1 new_h1 = h1;
                new_h1 += pw1[j]*((s[j+1]-'a'+1)-(s[j]-'a'+1));
                new_h1 += pw1[j+1]*((s[j]-'a'+1)-(s[j+1]-'a'+1));
                if(st1.count(new_h1.val()) == 0){
                    continue;
                }
                ok = true;
                break;
            }
        }

        st.insert(h.val());
        st1.insert(h1.val());
        if(ok) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}