#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define x first
#define y second
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) {
    x < y ? x = y : T();
}
template <typename T> void chkmin(T &x, T y) {
    y < x ? x = y : T();
}
template <typename T> void readint(T &x) {
    x = 0;
    int f = 1;
    char c;

    for (c = getchar(); !isdigit(c); c = getchar())
        if (c == '-')
            f = -1;

    for (; isdigit(c); c = getchar())
        x = x * 10 + (c - '0');

    x *= f;
}
/*const int MOD=;
inline int dmy(int x){return x>=MOD?x-MOD:x;}
inline void inc(int &x,int y){x=dmy(x+y);}
int qmi(int x,int y)
{
    int ans=1;
    for(;y;y>>=1,x=1ll*x*x%MOD)
        if(y&1)ans=1ll*ans*x%MOD;
    return ans;
}*/
const int MAXN = 200005;

int n;
char str[MAXN];
int a[3][MAXN];
int b[9][MAXN];
int c[MAXN], al[9][MAXN << 2];
bool ok[9][MAXN << 2];
int col[MAXN << 2];
void mtcol(int id, int w) {
    col[id] = w;

    for (int k = 0; k < 9; ++k)
        ok[k][id] = (al[k][id] == w);
}
void pushdown(int id) {
    if (col[id] < 0)
        return;

    mtcol(id << 1, col[id]);
    mtcol(id << 1 | 1, col[id]);
    col[id] = -1;
}
void build(int id, int l, int r) {
    col[id] = -1;

    if (l == r) {
        for (int k = 0; k < 9; ++k)
            al[k][id] = b[k][l],
                        ok[k][id] = (c[l] == b[k][l]);

        return;
    }

    int mid = (l + r) >> 1;
    build(id << 1, l, mid);
    build(id << 1 | 1, mid + 1, r);

    for (int k = 0; k < 9; ++k)
        al[k][id] = (al[k][id << 1] == al[k][id << 1 | 1] ? al[k][id << 1] : -1),
                    ok[k][id] = ok[k][id << 1] && ok[k][id << 1 | 1];
}
void cover(int id, int l, int r, int ql, int qr, int w) {
    if (l == ql && r == qr)
        return mtcol(id, w);

    pushdown(id);
    int mid = (l + r) >> 1;

    if (ql <= mid)
        cover(id << 1, l, mid, ql, min(qr, mid), w);

    if (qr > mid)
        cover(id << 1 | 1, mid + 1, r, max(mid + 1, ql), qr, w);

    for (int k = 0; k < 9; ++k)
        ok[k][id] = ok[k][id << 1] && ok[k][id << 1 | 1];
}
void reply() {
    bool fl = 0;

    for (int k = 0; k < 9; ++k)
        if (ok[k][1])
            fl = 1;

    printf(fl ? "Yes\n" : "No\n");
}

int main() {
#ifdef LOCAL
    freopen("code.in", "r", stdin);
    //  freopen("code.out","w",stdout);
#endif
    readint(n);

    for (int i = 0; i < 3; ++i) {
        scanf("%s", str + 1);

        for (int j = 1; j <= n; ++j)
            a[i][j] = (str[j] == 'I' ? 2 : (str[j] == 'O'));
    }

    for (int x = 0; x < 3; ++x)
        for (int y = 0; y < 3; ++y) {
            int z = (4 - x - y) % 3;

            for (int j = 1; j <= n; ++j)
                b[x * 3 + y][j] = (a[0][j] * x + a[1][j] * y + a[2][j] * z) % 3;
        }

    int Q;
    readint(Q);
    scanf("%s", str + 1);

    for (int j = 1; j <= n; ++j)
        c[j] = (str[j] == 'I' ? 2 : (str[j] == 'O'));

    build(1, 1, n);
    reply();

    while (Q--) {
        int l, r;
        char w;
        readint(l), readint(r), w = getchar();
        cover(1, 1, n, l, r, w == 'I' ? 2 : (w == 'O'));
        reply();
    }

    return 0;
}