#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int INF1 = 1e9 + 100;
int n;
int a[250250];
int go[250250], sp[250250][20];
ll S[250250];
struct Node{
array<int, 2> f[51];
int pos, sz;
Node(){}
Node(int _pos, int nxt){
f[0] = {nxt, 1};
pos = _pos;
sz = 1;
}
};
array<int, 2> operator + (const array<int, 2> &x, int y){
return {x[0], x[1]+y};
}
void merge(Node &P, const Node &L, const Node &R){
P.sz = 0;
for (int i=0;i<L.sz;i++){
if (L.f[i][0] >= R.pos + R.sz) P.f[P.sz++] = L.f[i];
else P.f[P.sz++] = R.f[L.f[i][0]-R.pos] + L.f[i][1];
}
for (int i=0;i<R.sz;i++){
if (P.sz==51) return;
P.f[P.sz++] = R.f[i];
}
}
void push(Node &L, const Node &R){
for (int i=0;i<L.sz;i++) if (L.f[i][0] < R.pos + R.sz) L.f[i] = R.f[L.f[i][0]-R.pos] + L.f[i][1];
for (int i=0;i<R.sz;i++){
if (L.sz==51) return;
L.f[L.sz++] = R.f[i];
}
}
struct Seg{
Node tree[1101000], ret;
void init(int i, int l, int r){
if (l==r) {tree[i] = Node(l, go[l]); return;}
int m = (l+r)>>1;
init(i<<1, l, m); init(i<<1|1, m+1, r);
tree[i].pos = l;
merge(tree[i], tree[i<<1], tree[i<<1|1]);
}
void update(int i, int l, int r, int s, int e){
if (r<s || e<l) return;
if (l==r){
tree[i] = Node(l, go[l]);
return;
}
int m = (l+r)>>1;
update(i<<1, l, m, s, e); update(i<<1|1, m+1, r, s, e);
merge(tree[i], tree[i<<1], tree[i<<1|1]);
}
void query(int i, int l, int r, int s, int e){
if (r<s || e<l) return;
if (s<=l && r<=e){
push(ret, tree[i]);
return;
}
int m = (l+r)>>1;
query(i<<1, l, m, s, e); query(i<<1|1, m+1, r, s, e);
}
}tree;
struct Seg2{
ll tree[500500];
int sz;
void init(int n){
sz = n;
for (int i=sz;i<sz*2;i++) tree[i] = a[i-sz];
for (int i=sz-1;i;i--) tree[i] = tree[i<<1] + tree[i<<1|1];
}
void update(int p, int x){
p += sz;
tree[p] = x;
for (p>>=1;p;p>>=1) tree[p] = tree[p<<1] + tree[p<<1|1];
}
ll query(int l, int r){
r++;
ll ret = 0;
for (l+=sz, r+=sz;l<r;l>>=1, r>>=1){
if (l&1) ret += tree[l++];
if (r&1) ret += tree[--r];
}
return ret;
}
}tree2;
void init(int n){
for (int i=1;i<=n;i++) S[i] = S[i-1] + a[i];
go[n+1] = n+1;
for (int i=1;i<=n;i++){
go[i] = n+1;
for (int j=i+2;j<=min(i+50, n);j++) if (S[j-1] - S[i] > max(a[i], a[j])){
go[i] = j;
break;
}
}
for (int i=n;i;i--) go[i] = min(go[i], go[i+1]);
tree.init(1, 1, n);
tree2.init(n+1);
}
int solve(int l, int r){
if (r-l+1 < 3) return -INF1;
int cnt = 0;
tree.ret.sz = 0;
tree.ret.pos = l;
tree.query(1, 1, n, l, r);
for (int i=0;i<tree.ret.sz;i++) cnt = max(cnt, tree.ret.f[i][1]-1);
return cnt * 2 + 1;
}
int query(int l, int r){
int ret = 1;
if (l==r) return ret;
if (tree2.query(l, r-1) > a[r]) ret = 2;
if (tree2.query(l+1, r) > a[l]) ret = 2;
int nl = r+1, nr = l-1;
ll sum = a[l];
for (int i=l+1;i<=min(l+30, r);sum += a[i++]) if (sum > a[i]) {nl = i; break;}
sum = a[r];
for (int i=r-1;i>=max(l, r-30);sum += a[i--]) if (sum > a[i]) {nr = i; break;}
if (nl <= nr) ret = 3;
return max({ret, solve(l, r), solve(nl, r) + 1, solve(l, nr) + 1, solve(nl, nr) + 2});
}
void update(int x, int y){
a[x] = y;
tree2.update(x, y);
for (int i=x;i>=max(1, x-50);i--){
go[i] = go[i+1];
ll sum = a[i+1];
for (int j=i+2;j<=min(i+50, go[i+1]-1);sum += a[j++]) if (sum > max(a[i], a[j])){
go[i] = j;
break;
}
}
tree.update(1, 1, n, max(1, x-50), x);
}
int main(){
scanf("%d", &n);
for (int i=1;i<=n;i++) scanf("%d", a+i);
init(n);
int q;
scanf("%d", &q);
while(q--){
int x, y, l, r;
scanf("%d %d %d %d", &x, &y, &l, &r);
if (a[x]!=y) update(x, y);
l++;
printf("%d\n", query(l, r));
}
}
