#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
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 <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
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;

int main() {
  int n; cin >> n;
  vector<string> p(n);
  for (string& p_i : p) cin >> p_i;
  vector<array<bool, 2>> x(n);
  if (p.front() == "Yes") {
    x.front() = {false, true};
  } else {
    x.front() = {true, false};
  }
  FOR(i, 1, n) REP(j, 2) x[i][j] = x[i - 1][(p[i] == "Yes") == j];
  cout << p.front() << '\n';
  if (n >= 2) cout << (p[0] == p[1] ? "Yes\n" : "No\n");
  FOR(i, 2, n) cout << (x[i - 2][p[i - 1] == p[i]] ? "Yes\n" : "No\n");
  return 0;
}