#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; template struct RollingHash { T s; explicit RollingHash(const T& s, const int base = 10007, const int mod = 1000000007) : base(base), mod(mod), hash({0}), power({1}) { const int n = s.size(); this->s.reserve(n); hash.reserve(n + 1); power.reserve(n + 1); add(s); } long long get(const int left, const int right) const { const long long res = hash[right] - hash[left] * power[right - left] % mod; return res < 0 ? res + mod : res; } void add(const T& t) { for (const auto c : t) { s.push_back(c); const int hash_nxt = (hash.back() * base % mod + c) % mod; hash.emplace_back(hash_nxt); const int power_nxt = power.back() * base % mod; power.emplace_back(power_nxt); } } int longest_common_prefix(const int i, const int j) const { const int n = s.size(); int lb = 0, ub = n + 1 - std::max(i, j); while (ub - lb > 1) { const int mid = (lb + ub) >> 1; (get(i, i + mid) == get(j, j + mid) ? lb : ub) = mid; } return lb; } template int longest_common_prefix(const RollingHash& t, const int i, const int j) const { int lb = 0; int ub = std::min(static_cast(s.size()) - i, static_cast(t.s.size()) - j) + 1; while (ub - lb > 1) { const int mid = (lb + ub) >> 1; (get(i, i + mid) == t.get(j, j + mid) ? lb : ub) = mid; } return lb; } std::vector power; private: const int base, mod; std::vector hash; }; int main() { int n; cin >> n; map> hashes; while (n--) { string s; cin >> s; RollingHash rolling_hash(s, 10007, MOD); const int l = s.length(), hash = rolling_hash.get(0, l); cout << (hashes[l].count(hash) ? "Yes\n" : "No\n"); hashes[l].emplace(hash); FOR(i, 1, l) { ll nhash = hash; nhash -= 1LL * rolling_hash.power[l - 1 - (i - 1)] * s[i - 1]; nhash -= 1LL * rolling_hash.power[l - 1 - i] * s[i]; nhash += 1LL * rolling_hash.power[l - 1 - (i - 1)] * s[i]; nhash += 1LL * rolling_hash.power[l - 1 - i] * s[i - 1]; hashes[l].emplace((nhash % MOD + MOD) % MOD); } } return 0; }