#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
using S=pair<array<array<int,4>,4>,int>;
S op(S x,S y){
  S ret;
  rep(i,4)rep(j,4){
    ret.first[i][j]=max(x.first[i][j],y.first[i][j]);
    reps(k,i,j+1)chmax(ret.first[i][j],x.first[i][k]+y.first[k][j]);
  }
  ret.second=x.second+y.second;
  return ret;
}
S e(){
  S ret;
  rep(i,4)rep(j,4)ret.first[i][j]=0;
  ret.second=0;
  return ret;
}
S mapping(int f,S x){
  if(f==-1)return x;
  rep(i,4)rep(j,4)x.first[i][j]=(i<=f&&f<=j?x.second:0);
  return x;
}
int composition(int f,int g){return f==-1?g:f;}
int id(){return -1;}
void SOLVE(){
  int n;
  cin>>n;
  vector<S>dat(n);
  rep(i,n){
    int a;
    cin>>a;
    dat[i].second=1;
    dat[i]=mapping(a-1,dat[i]);
  }
  lazy_segtree<S,op,e,int,mapping,composition,id>seg(dat);
  int q;
  cin>>q;
  while(q--){
    int t,l,r;
    cin>>t>>l>>r;
    l--;
    if(t==1){
      cout<<seg.prod(l,r).first[0][3]<<endl;
    }
    else{
      int x;
      cin>>x;
      x--;
      seg.apply(l,r,x);
    }
  }
}