#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 3e5 + 9;
const ll mod = 1e9 + 7;
const ll base = 31;
typedef pair<ll,ll> LL;
string s[5],p;
ll n,Q;
unordered_map<ll,ll> mp;
ll Getnum(char c){
if (c == 'J') return 0;
if (c == 'O') return 1;
return 2;
}
char Getchar(ll num){
if (num == 0) return 'J';
if (num == 1) return 'O';
return 'I';
}
void Fix(string &a){
if (a[0] != ' ') a = " " + a;
}
string Cross(string &a,string &b){
string ans;
Fix(a); Fix(b);
for (ll i = 1;i < a.size();i++){
if (a[i] == b[i]) ans += a[i];
else ans += Getchar(3 - Getnum(a[i]) - Getnum(b[i]));
}
return ans;
}
ll Hash(string &s){
ll res = 0; Fix(s);
for (ll i = 1;i < s.size();i++) res = (res*base + s[i] - 'A' + 1)%mod;
return res;
}
void BFS(){
queue<string> q;
q.push(s[1]); q.push(s[2]); q.push(s[3]);
mp[Hash(s[1])] = mp[Hash(s[2])] = mp[Hash(s[3])] = 1;
while(!q.empty()){
string t = q.front(); q.pop();
for (ll i = 1;i <= 3;i++){
string now = Cross(t,s[i]);
if (!mp[Hash(now)]) q.push(now),mp[Hash(now)] = 1;
}
}
}
ll st[4*N],lazy[4*N],pre[N],mu[N];
char c;
ll l,r;
ll cal(ll L,ll R,ll val){
ll p = (mu[n - R]*(pre[R - L])) % mod;
return (p*val) % mod;
}
void Pass(ll id,ll l,ll r){
ll mid = (l + r)/2;
ll t = lazy[id]; lazy[id] = 0;
if (!t) return;
st[id*2] = cal(l,mid,t); lazy[id*2] = t;
st[id*2 + 1] = cal(mid + 1,r,t); lazy[id*2 + 1] = t;
}
void upd(ll id,ll l,ll r,ll u,ll v,ll val){
if (v < l||r < u) return;
if (u <= l&&r <= v){
st[id] = cal(l,r,val); lazy[id] = val;
return;
}
ll mid = (l + r)/2; Pass(id,l,r);
upd(id*2,l,mid,u,v,val); upd(id*2 + 1,mid + 1,r,u,v,val);
st[id] = (st[id*2] + st[id*2 + 1])%mod;
}
ll Get(ll id,ll l,ll r,ll u,ll v){
if (v < l||r < u) return 0;
if (u <= l&&r <= v) return st[id];
ll mid = (l + r)/2; Pass(id,l,r);
return (Get(id*2,l,mid,u,v) + Get(id*2 + 1,mid + 1,r,u,v))%mod;
}
void Answer(){
ll have = Get(1,1,n,1,n);
if (mp.count(have)) cout<<"Yes\n";
else cout<<"No\n";
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
#define task "tst"
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
//freopen(task".out", "w", stdout);
}
cin>>n;
cin>>s[1]>>s[2]>>s[3];
s[1] = " " + s[1]; s[2] = " " + s[2]; s[3] = " " + s[3];
mu[0] = 1; pre[0] = 1;
for (ll i = 1;i <= n;i++){
mu[i] = (mu[i - 1]*base)%mod;
pre[i] = (pre[i - 1] + mu[i])%mod;
}
BFS();
cin>>Q>>p; p = " " + p; //cout<<cal(4,4,1); return 0;
for (ll i = 1;i <= n;i++) upd(1,1,n,i,i,p[i] - 'A' + 1);
Answer();
while(Q--){
cin>>l>>r>>c;
upd(1,1,n,l,r,c - 'A' + 1); Answer();
}
}
