#include<bits/stdc++.h>
using namespace std;

const int NR = 2e5;
const int mod0 = 1e9 + 7;
const int mod1 = 1e9 + 9;

int n, q;
int p0[NR + 5], p1[NR + 5], e0[NR + 5], e1[NR + 5], s0[NR * 4 + 5], s1[NR * 4 + 5], lz[NR * 4 + 5];
pair<int, int> h[9];
string sa, sb, sc, st;

bool check(pair<int, int> p) {
    for(int i = 0; i < 9; i++) {
        if(p == h[i]) {
            return 1;
        }
    }
    return 0;
}

void tr(const string &s, vector<int> &a) {
    for(int i = 0; i < n; i++) {
        if(s[i] == 'J') {
            a[i] = 1;
        }
        else if(s[i] == 'O') {
            a[i] = 2;
        }
        else {
            a[i] = 3;
        }
    }
}

vector<int> cross(const vector<int> &a, const vector<int> &b) {
    vector<int> res(n);
    for(int i = 0; i < n; i++) {
        if(a[i] == b[i]) {
            res[i] = a[i];
        }
        else {
            res[i] = a[i] ^ b[i];
        }
    }
    return res;
}

int h0(const vector<int> &a) {
    int res = 0;
    for(int i = 0; i < n; i++) {
        res = (37ll * res + a[i]) % mod0;
    }
    return res;
}

int h1(const vector<int> &a) {
    int res = 0;
    for(int i = 0; i < n; i++) {
        res = (53ll * res + a[i]) % mod1;
    }
    return res;
}

void build(const vector<int> &a, int p, int l, int r) {
    if(l == r) {
        s0[p] = a[l];
        s1[p] = a[l];
        return;
    }
    int mid = l + r >> 1;
    build(a, p * 2, l, mid);
    build(a, p * 2 + 1, mid + 1, r);
    s0[p] = (1ll * s0[p * 2] * p0[r - mid] % mod0 + s0[p * 2 + 1]) % mod0;
    s1[p] = (1ll * s1[p * 2] * p1[r - mid] % mod1 + s1[p * 2 + 1]) % mod1;   
}

void modify(int p, int l, int r, int a, int b, int v) {
    if(l >= a && r <= b) {
        s0[p] = 1ll * v * e0[r - l] % mod0;
        s1[p] = 1ll * v * e1[r - l] % mod1;
        lz[p] = v;
        return;
    }
    int mid = l + r >> 1;
    if(lz[p]) {
        s0[p * 2] = 1ll * lz[p] * e0[mid - l] % mod0;
        s1[p * 2] = 1ll * lz[p] * e1[mid - l] % mod1;
        lz[p * 2] = lz[p];
        s0[p * 2 + 1] = 1ll * lz[p] * e0[r - mid - 1] % mod0;
        s1[p * 2 + 1] = 1ll * lz[p] * e1[r - mid - 1] % mod1;
        lz[p * 2 + 1] = lz[p];
        lz[p] = 0;
    }
    if(a <= mid) {
        modify(p * 2, l, mid, a, b, v);
    }
    if(b > mid) {
        modify(p * 2 + 1, mid + 1, r, a, b, v);
    }
    s0[p] = (1ll * s0[p * 2] * p0[r - mid] % mod0 + s0[p * 2 + 1]) % mod0;
    s1[p] = (1ll * s1[p * 2] * p1[r - mid] % mod1 + s1[p * 2 + 1]) % mod1;
}

int main() {
    // freopen("a.in", "r", stdin);
    // freopen("a.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> sa >> sb >> sc >> q >> st;
    vector<int> a(n), b(n), c(n), ab(n), ac(n), bc(n), abc(n), acb(n), bca(n), t(n);
    tr(sa, a);
    tr(sb, b);
    tr(sc, c);
    tr(st, t);
    ab = cross(a, b);
    ac = cross(a, c);
    bc = cross(b, c);
    abc = cross(ab, c);
    acb = cross(ac, b);
    bca = cross(bc, a);
    h[0] = make_pair(h0(a), h1(a));
    h[1] = make_pair(h0(b), h1(b));
    h[2] = make_pair(h0(c), h1(c));
    h[3] = make_pair(h0(ab), h1(ab));
    h[4] = make_pair(h0(ac), h1(ac));
    h[5] = make_pair(h0(bc), h1(bc));
    h[6] = make_pair(h0(abc), h1(abc));
    h[7] = make_pair(h0(acb), h1(acb));
    h[8] = make_pair(h0(bca), h1(bca));
    p0[0] = 1;
    e0[0] = 1;
    p1[0] = 1;
    e1[0] = 1;
    for(int i = 1; i <= n; i++) {
        p0[i] = 37ll * p0[i - 1] % mod0;
        e0[i] = (e0[i - 1] + p0[i]) % mod0;
        p1[i] = 53ll * p1[i - 1] % mod1;
        e1[i] = (e1[i - 1] + p1[i]) % mod1;
    }
    build(t, 1, 0, n - 1);
    if(check(make_pair(s0[1], s1[1]))) {
        cout << "Yes\n";
    }
    else {
        cout << "No\n";
    }
    for(int i = 1; i <= q; i++) {
        int l, r, v;
        char c;
        cin >> l >> r >> c;
        if(c == 'J') {
            v = 1;
        }
        else if(c == 'O') {
            v = 2;
        }
        else {
            v = 3;
        }
        modify(1, 0, n - 1, l - 1, r - 1, v);
        if(check(make_pair(s0[1], s1[1]))) {
            cout << "Yes\n";
        }
        else {
            cout << "No\n";
        }
    }

    return 0;
}