#include <bits/stdc++.h>
#define ls p*2
#define rs p*2+1
using namespace std;
typedef long long ll;
const int N=5e4+10;
ll n,q,a[N],s[N],ans=-1e18;
struct node {
	int l,r;
	ll v,t; 
}tr[N*4];
void build (int p,int l,int r) {
	tr[p].l=l;
	tr[p].r=r;
	tr[p].t=0;
	if (l==r) {
		tr[p].v=a[l];
		return;
	}
	int mid=(l+r)/2;
	build(ls,l,mid);
	build(rs,mid+1,r);
	tr[p].v=tr[ls].v+tr[rs].v;
}
void pushdown (int p) {
	tr[ls].t+=tr[p].t;
	tr[rs].t+=tr[p].t;
	tr[ls].v+=tr[p].t*(tr[ls].r-tr[ls].l+1);
	tr[rs].v+=tr[p].t*(tr[rs].r-tr[rs].l+1);
	tr[p].t=0;
}
ll query (int p,int l,int r) {
	if (tr[p].l>=l&&tr[p].r<=r) return tr[p].v;
	int mid=(tr[p].l+tr[p].r)/2;
	ll sum=0;
	pushdown(p);
	if (l<=mid) sum+=query(ls,l,r);
	if (r>mid) sum+=query(rs,l,r);
	return sum;
}
void update (int p,int l,int r,ll k) {
	if (tr[p].l>=l&&tr[p].r<=r) {
		tr[p].t+=k;
		tr[p].v+=k*(tr[p].r-tr[p].l+1);
		return;
	}
	int mid=(tr[p].l+tr[p].r)/2;
	pushdown(p);
	if (l<=mid) update(ls,l,r,k);
	if (r>mid) update(rs,l,r,k);
	tr[p].v=tr[ls].v+tr[rs].v;
}
int main () {
	freopen("hod.in","r",stdin);
	freopen("hod.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin >> n;
	for (int i=1;i<=n;i++) {
		cin >> a[i];
		s[i]=s[i-1]+a[i];
		ans=max(ans,s[i]);
	}
	cout << ans <<endl;
	cout << "qwq" <<endl;
	build(1,1,n);
	cin >> q;
	while (q--) {
		int opt,l,r,k;
		cin >> opt >> l >> r;
		if (opt==1) {
			ll sum=query(1,1,l);
			for (int i=l+1;i<=r;i++) {
				sum=max(sum,query(1,1,i));
			}
			cout << sum <<endl;
		}else{
			cin >> k;
			update(1,l,r,k);
		}
	}
	return 0;
}