#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	long long mod1 = 1000000007;
	long long mod2 = 998244353;
	int kind = 27;
	vector<long long>table1(1000006), table2(100006);
	table1[0] = 1, table2[0] = 1;
	rep2(i, 1, table1.size()) {
		table1[i] = (table1[i - 1] * kind) % mod1;
		table2[i] = (table2[i - 1] * kind) % mod2;
	}
	set<long long>st1, st2;
	rep(i, n) {
		string s; cin >> s;
		long long base1 = 0;
		long long base2 = 0;
		rep(j, s.size()) {
			base1 += table1[j] * (s[j] - 'a' + 1);
			base1 %= mod1;
			base2 += table2[j] * (s[j] - 'a' + 1);
			base2 %= mod2;
		}
		bool chk = false;
		if (st1.count(base1) && st2.count(base2))chk = true;
		rep(j, s.size() - 1) {
			long long val1 = base1;
			val1 += mod1 - table1[j + 0] * (s[j + 0] - 'a' + 1) % mod1;
			val1 += mod1 - table1[j + 1] * (s[j + 1] - 'a' + 1) % mod1;
			val1 += table1[j + 0] * (s[j + 1] - 'a' + 1);
			val1 += table1[j + 1] * (s[j + 0] - 'a' + 1);
			val1 %= mod1;
			long long val2 = base2;
			val2 += mod2 - table2[j + 0] * (s[j + 0] - 'a' + 1) % mod2;
			val2 += mod2 - table2[j + 1] * (s[j + 1] - 'a' + 1) % mod2;
			val2 += table2[j + 0] * (s[j + 1] - 'a' + 1);
			val2 += table2[j + 1] * (s[j + 0] - 'a' + 1);
			val2 %= mod2;
			if (st1.count(val1) && st2.count(val2))chk = true;
		}
		if (chk)cout << "Yes" << endl;
		else cout << "No" << endl;
		st1.insert(base1);
		st2.insert(base2);
	}
	return 0;
}