AC

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

//#pragma gcc optimize("Ofast,unroll-loops")
//#pragma gcc target("sse,sse2,sse3,ssse3,sse4,avx,avx2,fma,abm,mmx,popcnt,tune=native")
//#define int long long
//#define double long double
#define MP make_pair
#define pF first
#define pS second
#define MOD 100000007
#define K 420

vector<int> crs(vector<int> a, vector<int> b)
{
    vector<int> ret;
    for (int i = 0; i < a.size(); i++)
        if (a[i] == b[i])
            ret.push_back(a[i]);
        else
            ret.push_back(3 - a[i] - b[i]);
    return ret;
}

vector<int> ps;

void fk(vector<int> &s, vector<int> &ret, int Lp, int Rp)
{
    for (int i = Lp; i <= Rp; i++)
    {
        ret[i] = 0;

        for (int j = ps[i]; j < ps[i + 1]; j++)
            ret[i] = (ret[i] * 3 + s[j]) % MOD;
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int N, Q;
    string oT;
    vector<string> oS(3);
    cin >> N >> oS[0] >> oS[1] >> oS[2] >> Q >> oT;

    vector<vector<int>> S(3);
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < N; j++)
            if (oS[i][j] == 'J')
                S[i].push_back(0);
            else if (oS[i][j] == 'O')
                S[i].push_back(1);
            else
                S[i].push_back(2);

    vector<int> T;
    for (int i = 0; i < N; i++)
        if (oT[i] == 'J')
            T.push_back(0);
        else if (oT[i] == 'O')
            T.push_back(1);
        else
            T.push_back(2);

    set<vector<int>> st;
    st.insert(S[0]), st.insert(S[1]), st.insert(S[2]);

    bool chg = true;
    int ls = 0;
    while (chg)
    {
        chg = false;

        for (int i = 0; i < S.size(); i++)
            for (int j = i + 1; j < S.size(); j++)
            {
                vector<int> t = crs(S[i], S[j]);
                if (!st.count(t))
                    st.insert(t), S.push_back(t), chg = true;
            }
    }

    int NK = (N - 1) / K + 1;
    ps.resize(NK + 1);
    for (int i = 0; i < NK; i++)
        ps[i] = i * K;
    ps[NK] = N;

    vector<vector<int>> vS(S.size(), vector<int>(NK));
    for (int i = 0; i < S.size(); i++)
        fk(S[i], vS[i], 0, NK - 1);

    vector<int> vT(NK);
    fk(T, vT, 0, NK - 1);

    bool suc = false;
    for (auto v : vS)
        if (v == vT)
            suc = true;

    if (suc)
        cout << "Yes\n";
    else
        cout << "No\n";

    int A1 = 0;
    for (int i = 0; i < K; i++)
        A1 = (A1 * 3 + 1) % MOD;

    vector<int> AS(NK, -1);
    while (Q--)
    {
        char oC;
        int L, R;
        cin >> L >> R >> oC, L--, R--;

        int C;
        if (oC == 'J')
            C = 0;
        else if (oC == 'O')
            C = 1;
        else
            C = 2;

        int Lp = L / K, Rp = R / K;
        if (AS[Lp] != -1)
            for (int i = ps[Lp]; i < ps[Lp + 1]; i++)
                T[i] = AS[Lp];
        if (AS[Rp] != -1)
            for (int i = ps[Rp]; i < ps[Rp + 1]; i++)
                T[i] = AS[Rp];
        AS[Lp] = AS[Rp] = -1;

        if (Rp - Lp <= 1)
        {
            for (int i = L; i <= R; i++)
                T[i] = C;
            fk(T, vT, Lp, Rp);
        }
        else
        {
            for (int i = L; i < ps[Lp + 1]; i++)
                T[i] = C;
            fk(T, vT, Lp, Lp);

            for (int i = R; i >= ps[Rp]; i--)
                T[i] = C;
            fk(T, vT, Rp, Rp);

            Lp++, Rp--;
            for (int i = Lp; i <= Rp; i++)
                AS[i] = C, vT[i] = A1 * C % MOD;
        }

        bool suc = false;
        for (auto v : vS)
            if (v == vT)
                suc = true;

        if (suc)
            cout << "Yes\n";
        else
            cout << "No\n";
    }

    return 0;
}

//      *   *  *****  *   *  *   *   ****  ****    ****     **    **
//     *   *  *      **  *  *   *  *      *   *  *        * *   * *
//    *****  *****  * * *  *   *  *      ****   *       *  *     *
//   *   *      *  *  **  *   *  *      *  *   *       *****    *
//  *   *  *****  *   *   ***    ****  *   *    ****     *   *****

//      *****  *****  *   *  *      *****  *   *  *****  *****
//        *   *   *  *   *  *        *    **  *    *    *   *
//       *   *   *  *****  *        *    * * *    *    *****
//   *  *   *   *    *    *        *    *  **    *    *
//  ****   *****    *    *****  *****  *   *    *    *