#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector 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; int p = 10007; const int N = 1000000; mint pw[N+1]; void init(){ pw[0] = 1; for(int i = 1; i <= N; i++) pw[i] = pw[i-1]*p; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; init(); int n; cin >> n; set st; for(int i = 0; i < n; i++){ string s; cin >> s; mint h = 0; int m = s.size(); for(int j = 0; j < m; j++){ h += pw[j]*(s[j]-'a'+1); } bool ok = false; if(st.count(h.val())){ ok = true; }else{ for(int j = 0; j+1 < m; j++){ mint new_h = h; new_h -= pw[j]*(s[j]-'a'+1); new_h += pw[j+1]*(s[j]-'a'+1); new_h -= pw[j+1]*(s[j+1]-'a'+1); new_h += pw[j]*(s[j+1]-'a'+1); if(st.count(new_h.val())){ ok = true; break; } } } st.insert(h.val()); if(ok) cout << "Yes" << endl; else cout << "No" << endl; } }