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

const int K=4;

struct S{
	int length;
	int d[K][K]={0};
	S(int length=0):length(length){}
};

void expand(S &x){
	for(int l=1;l<K;l++){
		for(int i=0;i+l<K;i++){
			x.d[i][i+l]=max(x.d[i][i+l],x.d[i+1][i+l]);
			x.d[i][i+l]=max(x.d[i][i+l],x.d[i][i+l-1]);
		}
	}
}

S op(S x,S y){
	expand(x);expand(y);
	S z;
	for(int i=0;i<K;i++){
		for(int j=i;j<K;j++){
			for(int k=0;k<=i;k++){
				z.d[k][j]=max(z.d[k][j],x.d[k][i]+y.d[i][j]);
			}
		}
	}
	z.length=x.length+y.length;
	return z;
}

S e(){
	return S();
}
S mapping(int f,S x){
	if(f==-1)return x;
	x=S(x.length);x.d[f][f]=x.length;return x;
}

int composition(int f,int g){return (f==-1)?g:f;}

int id(){return -1;}

int main(){
	int n;cin>>n;
	vector<int> a(n);for(auto &e:a){cin>>e;e--;}
	vector<S> s(n);
	for(int i=0;i<n;i++){
		s[i].length=1;s[i].d[a[i]][a[i]]=1;
	}
	lazy_segtree<S,op,e,int,mapping,composition,id> seg(s);
	int q;cin>>q;
	while(q--){
		int type;cin>>type;
		if(type==1){
			int l,r;cin>>l>>r;l--;
			auto res=seg.prod(l,r);expand(res);
			cout<<res.d[0][K-1]<<endl;
		}
		if(type==2){
			int l,r,x;cin>>l>>r>>x;l--;x--;
			seg.apply(l,r,x);
		}
	}
}