#include <bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vvvvvb = vector<vvvvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}
ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;
}

bool DEB = 0;

using mint = modint1000000007;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;


vector<mint> fact, factinv, inv, factK;
const ll mod = 1e9 + 7;
void prenCkModp(ll n) {
    //factK.resize(4*n+5);
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
    //factK[0]=1;
    //for(ll i=1;i<4*n+5;i++){
    //    factK[i]=factK[i-1]*mint(K-i+1);
    //    //K*(K-1)*...*(K-i+1);
    //}
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}
//mint nCkK(ll n,ll k){
//    if(K<n||K-n<k)return 0;
//    mint res=factK[n+k];
//    res*=factK[n].inv();
//    res*=factinv[k];
//    return res;
//}

struct S {
    vvll DP;
    ll LEN;
};

S op(S A, S B) {
    S res;
    res.LEN = A.LEN + B.LEN;
    res.DP.assign(5, vll(5, 0));
    rep(j, 5)rep(i, j + 1) {
        ll M = 0;
        for (ll k = i; k <= j; k++) {
            chmax(M, A.DP[i][k] + B.DP[k][j]);
        }
        res.DP[i][j] = M;
    }
    return res;
}

S e() {
    S res;
    res.LEN = 0;
    res.DP.assign(5, vll(5, 0));
    return res;
}

ll id() { return -1; };

S init(ll l) {
    S res;
    res.LEN = 1;
    res.DP.assign(5, vll(5, 0));
    rep(i, l + 1)rep(j, 5) {
        if (l <= j)res.DP[i][j] = res.LEN;
    }
    return res;
}

S mapping(ll l, S A) {
    if (l == -1)return A;
    rep(i, 5)rep(j, 5) {
        A.DP[i][j] = 0;
        if (i <= l && l <= j)A.DP[i][j] = A.LEN;
    }
    return A;
}
ll comp(ll l, ll r) {
    if(l==-1)return r;
    if(r==-1)return l;
    return l;
}

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N;
    cin >> N;
    lazy_segtree<S, op, e, ll, mapping, comp, id> seg(N);
    vll A(N);
    rep(i, N) {
        cin >> A[i];
        seg.set(i, init(A[i]));
    }
    ll Q;
    cin >> Q;
    rep(q, Q) {
        ll T;
        cin >> T;
        if (T == 1) {
            ll L, R;
            cin >> L >> R;
            S res = seg.prod(L - 1, R);
            ll an = 0;
            rep(i, 5)rep(j, 5) {
                chmax(an, res.DP[i][j]);
                //cout << i << " " << j << " " << res.DP[i][j] << endl;
            }
            cout << an << endl;
        }
        else {
            ll L, R, X;
            cin >> L >> R >> X;
            seg.apply(L - 1, R, X);
        }
    }

}