#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;

void speedUpIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/*--------------------------------------------------*/
typedef pair<int, int> P;

const int INF = 1e9;
const ll LINF = 1e18;
const int MX = 100010;

void solve() {
    int n;
    cin >> n;
    V<int> p(n + 1, 1);
    rep1(i, n) {
        string s;
        cin >> s;
        if (s == "Yes") {
            p[i] = 1;
        } else {
            p[i] = 0;
        }
    }
    VV<bool> dp(n + 1, V<bool>(2));
    dp[0][1] = true;
    rep1(i, n) {
        int j = p[i] == p[i - 1] ? 1 : 0;
        dp[i][p[i]] = dp[i - 1][j];
        j = (1 - p[i]) == p[i - 1] ? 1 : 0;
        dp[i][1 - p[i]] = dp[i - 1][j];
        cout << (dp[i][p[i]] ? "Yes" : "No") << "\n";
    }
}

int main() {
    speedUpIO();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        // cout << solve() << "\n";
        // cout << (solve() ? "YES" : "NO") << "\n";
        // cout << fixed << setprecision(15) << solve() << "\n";
    }
    return 0;
}