#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
const int KIND = 4;
struct S {
	int dp[KIND][KIND] = { 0 };
	int length = 0;
};
using F = int;
const F ID = -1;
S op(S sl, S sr) {
	S ret;
	rep(i, KIND)rep2(j, i, KIND) {
		rep2(k, i, j + 1) {
			chmax(ret.dp[i][j], sl.dp[i][k] + sr.dp[k][j]);
		}
	}
	ret.length = sl.length + sr.length;
	return ret;
}
S e() { return S(); }
S mapping(F f, S x) {
	if (-1 == f)return x;
	rep(i, KIND)rep2(j, i, KIND) {
		if (i <= f && f <= j)x.dp[i][j] = x.length;
		else x.dp[i][j] = 0;
	}
	return x;
}
F composition(F f, F g) { return (f == ID) ? g : f; }
F id() { return ID; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)cin >> a[i], a[i]--;
	vector<S>s(n);
	rep(i, n) {
		s[i].length = 1;
		s[i] = mapping(a[i], s[i]);
		rep(i, KIND)rep(j, KIND) {

		}
	}
	lazy_segtree<S, op, e, F, mapping, composition, id> seg(s);
	int q; cin >> q;
	while (q--) {
		int t; cin >> t;
		if (1 == t) {
			int l, r; cin >> l >> r;
			l--, r--;
			auto get = seg.prod(l, r + 1);
			cout << get.dp[0][KIND - 1] << endl;
		}
		else {
			int l, r, x; cin >> l >> r >> x;
			l--, r--, x--;
			seg.apply(l, r + 1, x);
		}
	}
	return 0;
}