#include<iostream>
#define int long long
#define undef -1e16
#define inf (1LL<<31)
#define lid id<<1
#define rid id<<1|1
using namespace std;
const int N=2e5+5;
int n;
struct Segment{
	int l,r;
	int add,cge;
	int Nmax,Hmax;
}tr[N<<2];
int a[N];
void pushup(int id){
	tr[id].Nmax=max(tr[lid].Nmax,tr[rid].Nmax);
	tr[id].Hmax=max(tr[lid].Hmax,tr[rid].Hmax);
}
void build(int id,int L,int R){
	tr[id].l=L,tr[id].r=R;
	tr[id].cge=undef;
	tr[id].add=0;
	if(tr[id].l==tr[id].r){
		tr[id].Hmax=tr[id].Nmax=a[L];
		return;
	}
	int M=(L+R)>>1;
	build(lid,L,M);
	build(rid,M+1,R);
	pushup(id);
}
void pushdown(int id){
	if(tr[id].cge!=undef){
		tr[lid].cge=tr[id].cge;
		tr[rid].cge=tr[id].cge;
		tr[lid].Nmax=tr[id].cge;
		tr[rid].Nmax=tr[id].cge;
		tr[lid].Hmax=max(tr[lid].Hmax,tr[lid].Nmax);
		tr[rid].Hmax=max(tr[rid].Hmax,tr[rid].Nmax);
		tr[lid].add=0;
		tr[rid].add=0;
		tr[id].cge=undef;
	}
	if(tr[id].add){
		tr[lid].add+=tr[id].add;
		tr[rid].add+=tr[id].add;
		tr[lid].Nmax+=tr[id].add;
		tr[rid].Nmax+=tr[id].add;
		tr[lid].Hmax=max(tr[lid].Hmax,tr[lid].Nmax);
		tr[rid].Hmax=max(tr[rid].Hmax,tr[rid].Nmax);
		tr[id].add=0;
	}
}
void update(int id,int L,int R,int k){
	pushdown(id);
	if(L<=tr[id].l&&tr[id].r<=R){
		tr[id].add+=k;
		tr[id].Nmax+=k;
		tr[id].Hmax=max(tr[id].Hmax,tr[id].Nmax);
		return;
	}
	int M=(tr[id].l+tr[id].r)>>1;
	if(L<=M) update(lid,L,R,k);
	if(M<R) update(rid,L,R,k);
	pushup(id);
}
void modify(int id,int L,int R,int k){
	pushdown(id);
	if(L<=tr[id].l&&tr[id].r<=R){
		tr[id].cge=k;
		tr[id].add=0;
		tr[id].Nmax=k;
		tr[id].Hmax=max(tr[id].Hmax,tr[id].Nmax);
		return;
	}
	int M=(tr[id].l+tr[id].r)>>1;
	if(L<=M) modify(lid,L,R,k);
	if(M<R) modify(rid,L,R,k);
	pushup(id);
}
int queryN(int id,int L,int R){
	pushdown(id);	
	if(L<=tr[id].l&&tr[id].r<=R){
		return tr[id].Nmax;
	}
	int M=(tr[id].l+tr[id].r)>>1;
	int Ans=-inf;
	if(L<=M) Ans=max(Ans,queryN(lid,L,R));
	if(M<R) Ans=max(Ans,queryN(rid,L,R));
	return Ans;
}
int queryH(int id,int L,int R){
	pushdown(id);
	if(L<=tr[id].l&&tr[id].r<=R){
		return tr[id].Hmax;
	}
	int M=(tr[id].l+tr[id].r)>>1;
	int Ans=-inf;
	if(L<=M) Ans=max(Ans,queryH(lid,L,R));
	if(M<R) Ans=max(Ans,queryH(rid,L,R));
	return Ans;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	build(1,1,n);
	int q;
	cin>>q;
	while(q--){
		char opt;int x,y,z;
		cin>>opt>>x>>y;
		switch(opt){
		case 'A':
			cout<<queryH(1,x,y)<<"\n";
			break;
		case 'Q':
			cout<<queryN(1,x,y)<<"\n";
			break;
		case 'P':
			cin>>z;
			update(1,x,y,z);
			break;
		case 'C':
			cin>>z;
			modify(1,x,y,z);
			break;
		}
	}
	return 0;
}