#include <bits/stdc++.h>
#include <atcoder/lazysegtree>
using namespace std;
using namespace atcoder;
vector<vector<int>> base(4, vector<int>(4, 0));
struct S{
	vector<vector<int>> lis;
	int size;
};
S op(S a, S b) {
	vector<vector<int>> lis = base;
	for (int i = 0;i < 4;i++) for (int j = i;j <  4;j++) for (int k = j;k < 4;k++) for (int l = k;l < 4;l++) {
		lis[i][l] = max(lis[i][l], a.lis[i][j] + b.lis[k][l]);
	}
	return {lis, a.size + b.size};
}
S e() {
	return {base, 0};
}
S mapping(int f, S x) {
	if (f == -1) return x;
	vector<vector<int>> lis = base;
	lis[f][f] = x.size;
	return S {lis, x.size};
}
int composition(int f, int g) {
	if (f == -1) return g;
	return f;
}
int id() {
	return -1;
}
int main() {
	int N;cin >> N;
	vector<S> A(N + 1, {base, 1});
	for (int i = 1;i <= N;i++) {
		int a;cin >> a;
		a--;
		A[i].lis[a][a] = 1;
	}
	lazy_segtree<S, op, e, int, mapping, composition, id> seg(A);
	int Q;cin >> Q;
	while (Q--) {
		int op;cin >> op;
		if (op == 2) {
			int l, r, x;cin >> l >> r >> x;
			seg.apply(l, r + 1, x - 1);
			continue;
		}
		int l,r;cin >> l >> r;
		int ans = 0;
		auto res = seg.prod(l, r + 1);
		for (int i = 0;i < 4;i++) for (int j = i;j < 4;j++) ans = max(ans, res.lis[i][j]);
	        cout << ans << endl;	
	}	
}