// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;
int n;
set<string> st, nst;
int q;
string t;
int main() {
#ifndef DEBUG
ios::sync_with_stdio(0), cin.tie(0);
#endif
cin >> n;
REP (i, 0, 3) {
string s; cin >> s;
st.insert(s);
}
while (1) {
for (string a : st) {
for (string b : st) {
string c = a;
REP (i, 0, n) {
if (a[i] == b[i]) {
c[i] = a[i];
} else {
c[i] = 'J' + 'O' + 'I' - a[i] - b[i];
}
}
nst.insert(c);
}
}
if (SZ(nst) == SZ(st)) {
break;
}
swap(st, nst);
}
cin >> q;
cin >> t;
if (st.find(t) != st.end()) {
cout << "Yes\n";
} else {
cout << "No\n";
}
while (q--) {
int l, r; char c; cin >> l >> r >> c;
l--; r--;
REP (i, l, r + 1) {
t[i] = c;
}
if (st.find(t) != st.end()) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
}
