#include <iostream>
#include <random>

typedef long long ll;
typedef double lf;
typedef __int128_t LL;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e5 + 10;
const ll mod = 212370440130137957ll;

int n, q;
char str[MAXN];
int s[10][MAXN];
ll mch[10];
inline int Tr(char ch) {return (ch == 'J' ? 0 : (ch == 'O' ? 1 : 2));}

inline void Cross(int x, int u, int v)
{
    for (int i = 1; i <= n; i++)
        if (s[u][i] == s[v][i]) s[x][i] = s[u][i];
        else s[x][i] = 3 - s[u][i] - s[v][i];
}

ll w[MAXN], val[3];
mt19937_64 Rand(102039213);

struct Node
{
    ll hsh, sum;
    int lz;
}tr[MAXN << 2];
inline void Pushup(int cur)
{
    tr[cur].hsh = ((LL)tr[cur << 1].hsh + tr[cur << 1 | 1].hsh) % mod;
}
inline void Calc(int cur, int k)
{
    tr[cur].hsh = (LL)tr[cur].sum * val[k] % mod;
    tr[cur].lz = k;
}
inline void Pushdown(int cur)
{
    if (tr[cur].lz == -1) return;
    Calc(cur << 1, tr[cur].lz), Calc(cur << 1 | 1, tr[cur].lz);
    tr[cur].lz = -1;
}
void Build(int cur, int l, int r)
{
    tr[cur].lz = -1;
    if (l == r) tr[cur].sum = w[l], tr[cur].hsh = (LL)w[l] * val[s[9][l]] % mod;
    else
    {
        int mid = l + r >> 1;
        Build(cur << 1, l, mid), Build(cur << 1 | 1, mid + 1, r);
        Pushup(cur);
        tr[cur].sum = ((LL)tr[cur << 1].sum + tr[cur << 1 | 1].sum) % mod;    
    }
}
void Update(int cur, int l, int r, int x, int y, int k)
{
    if (x <= l && r <= y) Calc(cur, k);
    else
    {
        Pushdown(cur);
        int mid = l + r >> 1;
        if (x <= mid) Update(cur << 1, l, mid, x, y, k);
        if (y > mid) Update(cur << 1 | 1, mid + 1, r, x, y, k);
        Pushup(cur);
    }
}

inline void Check()
{
    ll tar = tr[1].hsh; bool flag = 0;
    for (int i = 0; i < 9; i++)
        if (tar == mch[i]) {flag = 1; break;}
    if (flag) cout << "Yes\n";
    else cout << "No\n";
}

int main()
{
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n);
    for (int i = 0; i < 3; i++)
    {
        Read(str + 1);
        for (int j = 1; j <= n; j++) s[i][j] = Tr(str[j]);
    }
    Cross(3, 0, 1), Cross(4, 1, 2), Cross(5, 0, 2), Cross(6, 3, 2), Cross(7, 4, 0), Cross(8, 5, 1);
    // for (int i = 0; i < 9; i++, cout << "\n")
    //     for (int j = 1; j <= n; j++) cout << s[i][j];
    for (int i = 1; i <= n; i++) w[i] = Rand() % mod;
    for (int i = 0; i < 3; i++) val[i] = Rand() % mod;
    Read(q), Read(str + 1);
    for (int i = 1; i <= n; i++) s[9][i] = Tr(str[i]);
    for (int i = 0; i < 9; i++)
    {
        mch[i] = 0;
        for (int j = 1; j <= n; j++) mch[i] = (mch[i] + (LL)w[j] * val[s[i][j]] % mod) % mod;
    }
    Build(1, 1, n);
    Check();
    int l, r; char op[5];
    while (q--)
    {
        Read(l), Read(r), Read(op);
        Update(1, 1, n, l, r, Tr(op[0]));
        Check();
    }
    return 0;
}