#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#define ll long long
#define _mp make_pair
#define _pb push_back
#define _1 first
#define _2 second
#define MAX_N 222222

using namespace std;

ll read(){ll x = 0;char c = 0, v = 0;do{c = getchar();if(c == '-')v = 1;} while(c < '0' || c > '9');do{x = (x << 3) + (x << 1) + c - '0';c = getchar();} while(c >= '0' && c <= '9');return v ? -x : x;}
char gtc(){char c = 0;while(c < 33)c = getchar();return c;}

const ll P1 = 200904101, P2 = 1000000007, Pz = 5;

pair<ll, ll> powz[MAX_N], powzs[MAX_N];

struct hnode
{
    pair<ll, ll> h;
    int len;
    hnode() { len = 0, h = _mp(0, 0); }
    hnode(pair<ll, ll> _h, int _len) : h(_h), len(_len) { ; }
    hnode(char c)
    {
        len = 1;
        if(c == 'J')
            h = _mp(1, 1);
        else if(c == 'O')
            h = _mp(2, 2);
        else if(c == 'I')
            h = _mp(3, 3);
        else
            h = _mp(4, 4);
    }
    
    hnode(char c, int _len)
    {
        len = _len;
        h = powzs[len];
        if(c == 'J')
            ;
        else if(c == 'O')
            h._1 = h._1 * 2 % P1, h._2 = h._2 * 2 % P2;
        else if(c == 'I')
            h._1 = h._1 * 3 % P1, h._2 = h._2 * 3 % P2;
        else
            h._1 = h._1 * 4 % P1, h._2 = h._2 * 4 % P2;
    }
};

hnode operator + (hnode a, hnode b)
{
    pair<ll, ll> h;
    h._1 = (a.h._1 * powz[b.len]._1 + b.h._1) % P1;
    h._2 = (a.h._2 * powz[b.len]._2 + b.h._2) % P2;
    return (hnode){h, a.len + b.len};
}

bool operator == (hnode a, hnode b) { return a.h == b.h && a.len == b.len; }

struct node
{
    int l, r;
    hnode h;
    char d;
    node *lc, *rc;
    void add(char c) { h = hnode(d = c, r - l + 1); }
    void pDown()
    {
        if(l != r && d)
            lc->add(d), rc->add(d), d = 0;
    }
    
    void pUp() { h = lc->h + rc->h; }
    void update(int L, int R, char c)
    {
        pDown();
        if(L == l && R == r)
        {
            add(c);
            return;
        }
        int mid = (l + r) >> 1;
        if(R <= mid)
            lc->update(L, R, c);
        else if(L > mid)
            rc->update(L, R, c);
        else
            lc->update(L, mid, c), rc->update(mid + 1, R, c);
        pUp();
    }
} _pool[MAX_N * 2], *null = _pool;

int _tot;

node* make(int l, int r)
{
    _pool[++_tot] = (node){l, r, hnode(), 0, null, null};
    return _pool + _tot;
}

node* bT(int l, int r, char* s)
{
    node* t = make(l, r);
    if(l == r)
    {
        t->add(s[l]);
        return t;
    }
    int mid = (l + r) >> 1;
    t->lc = bT(l, mid, s);
    t->rc = bT(mid + 1, r, s);
    t->pUp();
    return t;
}

int n, m;
char sa[MAX_N], sb[MAX_N], sc[MAX_N], s[MAX_N];
hnode a[9];

hnode getstr()
{
    hnode h;
    for(int i = 1; i <= n; i++)
        h = h + hnode(s[i]);
    return h;
}

char xrr(char a, char b)
{
    if(a == b)
        return a;
    return (int)'J' + (int)'O' + (int)'I' - (int)a - (int)b;
}

bool check(hnode h)
{
    for(int i = 0; i < 9; i++)
        if(h == a[i])
            return 1;
    return 0;
}

void MAIN()
{
    n = read();
    for(int i = 1; i <= n; i++)
        sa[i] = gtc();
    for(int i = 1; i <= n; i++)
        sb[i] = gtc();
    for(int i = 1; i <= n; i++)
        sc[i] = gtc();
    for(int i = 1; i <= n; i++)
        s[i] = sa[i];
    a[0] = getstr();
    for(int i = 1; i <= n; i++)
        s[i] = sb[i];
    a[1] = getstr();
    for(int i = 1; i <= n; i++)
        s[i] = sc[i];
    a[2] = getstr();
    for(int i = 1; i <= n; i++)
        s[i] = xrr(sa[i], sb[i]);
    a[3] = getstr();
    for(int i = 1; i <= n; i++)
        s[i] = xrr(sb[i], sc[i]);
    a[4] = getstr();
    for(int i = 1; i <= n; i++)
        s[i] = xrr(sc[i], sa[i]);
    a[5] = getstr();
    for(int i = 1; i <= n; i++)
        s[i] = xrr(xrr(sb[i], sc[i]), sa[i]);
    a[6] = getstr();
    for(int i = 1; i <= n; i++)
        s[i] = xrr(xrr(sc[i], sa[i]), sb[i]);
    a[7] = getstr();
    for(int i = 1; i <= n; i++)
        s[i] = xrr(xrr(sa[i], sb[i]), sc[i]);
    a[8] = getstr();
    m = read();
    for(int i = 1; i <= n; i++)
        s[i] = gtc();
    node* t = bT(1, n, s);
    printf(check(t->h) ? "Yes\n" : "No\n");
    for(int i = 1; i <= m; i++)
    {
        int l = read();
        int r = read();
        char c = gtc();
        t->update(l, r, c);
        printf(check(t->h) ? "Yes\n" : "No\n");
    }
}

void CLEAR()
{
    ;
}

void EXP()
{
    powzs[0] = _mp(0, 0);
    powz[0] = powzs[1] = _mp(1, 1);
    for(int i = 1; i < MAX_N - 10; i++)
    {
        powz[i]._1 = powz[i - 1]._1 * Pz % P1;
        powz[i]._2 = powz[i - 1]._2 * Pz % P2;
        powzs[i + 1]._1 = (powzs[i]._1 + powz[i]._1) % P1;
        powzs[i + 1]._2 = (powzs[i]._2 + powz[i]._2) % P2;
    }
}

int main()
{
    EXP();
    int T = 1;
    while(T--)
        MAIN(), CLEAR();
    return 0;
}