#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define munq(a) sort(all(a)); a.resize(unique(all(a))-a.begin())
#define sz(a) ((int)a.size())

#ifdef LOCAL
#define debug(...) [](auto...a){ ((cerr << a << ' '), ...) << endl; }(#__VA_ARGS__, ":", __VA_ARGS__)
#else
#define debug(...)
#endif

#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)

using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
    input >> data.x >> data.y;
    return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
tcT> vector <T> presum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    FOR (i, a.size()) {
        p[i + 1] = p[i] + a[i];
    }   
    return p;
}
tcT> vector <T> sufsum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    for (int i = (int)a.size() - 1; i >= 0; --i) {
        p[i] = p[i + 1] + a[i];
    }
    return p;
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }

V <vi> merge(V <vi> l, V <vi> r) {
    V <vi> t(4,vi(4));
    FOR(a, 4) {
        for (int c = a; c < 4; ++c) {
            for (int b = a; b <= c; ++b) {
                ckmax(t[a][c],l[a][b]+r[b][c]);
            }
        }
    }
    return t;
}
struct SegTree {
int n;
V <V <vi> > t;
vi prop;
void relax(int v) {
    t[v]=merge(t[v*2+1],t[v*2+2]);
}
void apply(int v, int x, int len) {
    prop[v]=x;
    FOR(a,4){
        for (int b = a; b < 4; ++b) {
            if (a <= x && x <= b) {
                t[v][a][b]=len;
            }
            else {
                t[v][a][b]=0;
            }
        }
    }
}
void push(int v, int l, int r) {
    if (prop[v]!=-1) {
        int m = (l + r) / 2;
        apply(v * 2 + 1, prop[v],m-l);
        apply(v * 2 + 2, prop[v],r-m);
        prop[v]=-1;
    }
}
void build(int v, int l, int r, vi &ar) {
    if (l + 1 == r) {
        for (int a = 0; a < 4; ++a) {
            for (int b = a; b < 4; ++b) {
                t[v][a][b] = (a <= ar[l]&&ar[l]<=b);
            }
        }
    debug(l,r);
    debug(t[v]);
        return;
    }
    int m = (l + r) / 2;
    build(v * 2 + 1, l,m , ar);build(v * 2 + 2, m, r, ar);
    relax(v);
    debug(l,r);
    debug(t[v]);
}

V <vi> get(int v, int l, int r, int ql, int qr) {
    if (qr <= l || r <= ql) {
        V <vi> ans(4,vi(4));return ans;
    }
    if (ql <= l && r <= qr) {
        return t[v];
    }
    int m = (l + r) / 2;
    push(v,l,r);
    return merge(get(v*2+1,l,m,ql,qr),get(v*2+2,m,r,ql,qr));
}
int get(int l, int r) {
    return get(0,0,n,l,r).front().back();
}       
void upd(int v, int l, int r, int ql, int qr, int x) {
    if (qr <= l || r <= ql) {
        return;
    }
    if (ql <= l && r <= qr) {
        apply(v,x,r-l);return;
    }
    int m = (l + r) / 2;
    push(v,l,r);
    upd(v * 2 + 1, l,m,ql,qr,x);
    upd(v * 2 + 2, m,r,ql,qr,x);
    relax(v);
}

SegTree(vi &ar) {
    n = sz(ar);
    t.resize(n<<2);
    FOR(i,n<<2){
        t[i].assign(4,vi(4));
    }
    prop.assign(n<<2,-1);
    build(0,0,n,ar);
}

void upd(int l, int r, int x) {
    upd(0,0,n,l,r,x);
}

};

signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int n;cin>>n;
    vi a(n);cin>>a;
    each(e,a){
        e--;
    }

    SegTree T(a);
    int q; cin >> q;
    rep (q) {
        int t,l, r; cin>>t >> l >> r; l--;
        if (t == 1) {
            cout << T.get(l,r)<<endl;
        }
        else {
            int x; cin >>x;x--;
            T.upd(l,r,x);
        }
    }   
}