#include<bits/stdc++.h>
using namespace std;
const int NR=2e5+10;
#define int long long
const int Base=2333;
const int MOD=1e9+7;
int n,q,arr[10][NR],pw[NR],spw[NR];
char s1[NR],s2[NR],s3[NR],str[NR];
int calc(int l,int r){return (spw[r]-spw[l-1]+MOD)%MOD;}
set<int>s;
map<char,int>mp;

#define lson (id<<1)
#define rson (id<<1|1)
#define mid ((l+r)>>1)
int sum[NR<<2],tag[NR<<2],num[NR<<2];
void addtag(int id,int x){
	sum[id]=num[id]*x%MOD;
	tag[id]=x;
}
void pushdown(int id,int l,int r){
	if(tag[id]==-1||l==r)return;
	addtag(lson,tag[id]);addtag(rson,tag[id]);
	tag[id]=-1;
}
void update(int id){
	sum[id]=(sum[lson]+sum[rson])%MOD;
}
void buildtree(int id,int l,int r){
	num[id]=calc(l,r);tag[id]=-1;
	if(l==r){
		sum[id]=mp[str[l]]*num[id]%MOD;
		return;
	}
	buildtree(lson,l,mid);
	buildtree(rson,mid+1,r);
	update(id);
}
void modify(int id,int l,int r,int L,int R,int x){
	pushdown(id,l,r);
//	printf("id:%lld l:%lld r:%lld\n",id,l,r);
	if(r<L||R<l)return;
	if(L<=l&&r<=R){
		addtag(id,x);
		return;
	}
	modify(lson,l,mid,L,R,x);
	modify(rson,mid+1,r,L,R,x);
	update(id);
}

void check(){
	if(s.count(sum[1]))puts("Yes");
	else puts("No");
}
signed main(){
	cin>>n;
	pw[0]=sum[0]=1;
	for(int i=1;i<=n;i++)
		pw[i]=pw[i-1]*Base%MOD,spw[i]=(spw[i-1]+pw[i])%MOD;
	scanf("%s %s %s",s1+1,s2+1,s3+1);
	mp['J']=0;mp['O']=1;mp['I']=2;
	for(int i=1;i<=n;i++){
		arr[1][i]=mp[s1[i]];
		arr[2][i]=mp[s2[i]];
		arr[3][i]=mp[s3[i]];
		arr[4][i]=(6-arr[1][i]-arr[2][i])%3;
		arr[5][i]=(6-arr[1][i]-arr[3][i])%3;
		arr[6][i]=(6-arr[2][i]-arr[3][i])%3;
		arr[7][i]=(3+arr[1][i]+arr[2][i]-arr[3][i])%3;
		arr[8][i]=(3+arr[1][i]-arr[2][i]+arr[3][i])%3;
		arr[9][i]=(3-arr[1][i]+arr[2][i]+arr[3][i])%3;
	}
	for(int i=1;i<=9;i++){
		int res=0;
		for(int j=1;j<=n;j++)(res+=arr[i][j]*pw[j])%=MOD/*,printf("%lld",arr[i][j])*/;
//		puts("");
		s.insert(res);
	}
	cin>>q;
	scanf("%s",str+1);
	buildtree(1,1,n);
	check();
	while(q--){
		int l,r;char c;cin>>l>>r>>c;
		modify(1,1,n,l,r,mp[c]);
		check(); 
	}
	return 0;
}