#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

struct S {
    vector<vector<ll>> vec;
    ll size;
};

// 最長 LIS の長さを求めたい
S op(S a, S b) {
    vector<vector<ll>> new_vec(4, vector<ll>(4, 0));
    for (ll i = 0; i < 4; i++) {
        for (ll j = i; j < 4; j++) {
            for (ll k = j; k < 4; k++) {
                new_vec[i][k] = max(new_vec[i][k], a.vec[i][j] + b.vec[j][k]);
            }
        }
    }
    return S{new_vec, a.size + b.size};
}

S e() {
    vector<vector<ll>> e_vec(4, vector<ll>(4, 0));
    return S{e_vec, 0};
}

ll INF = 10;

S mapping(ll f, S x) {
    vector<vector<ll>> new_vec(4, vector<ll>(4, 0));
    if (f == INF) {
        return x;
    }
    for (ll i = 0; i <= f; i++) {
        for (ll j = f; j < 4; j++) {
            new_vec[i][j] = x.size;
        }
    }
    return S{new_vec, x.size};
}

ll composition(ll f, ll g) {
    if (f == INF) {
        return g;
    }
    return f;
}

ll id() { return INF; }

int main() {
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
        A[i]--;
    }
    lazy_segtree<S, op, e, ll, mapping, composition, id> seg(N);
    for (ll i = 0; i < N; i++) {
        vector<vector<ll>> e_vec(4, vector<ll>(4, 0));
        for (ll j = 0; j <= A[i]; j++) {
            for (ll k = A[i]; k < 4; k++) {
                e_vec[j][k] = 1;
            }
        }
        seg.set(i, S{e_vec, 1});
    }
    ll Q;
    cin >> Q;
    for (ll i = 0; i < Q; i++) {
        ll t;
        cin >> t;
        if (t == 1) {
            ll l, r;
            cin >> l >> r;
            l--;
            r--;
            cout << (seg.prod(l, r + 1).vec)[0][3] << endl;
        } else {
            ll l, r, x;
            cin >> l >> r >> x;
            l--;
            r--;
            x--;
            seg.apply(l, r + 1, x);
        }
    }
}