#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 1e6 + 12, MOD = (int)1e9 + 7;

int n, a[N], q;
ll sf[N];

int solve(int l, int r) {
    ll cur = 0;
    sf[r] = a[r];
    for(int i = r - 1; i >= l; i--) {
        sf[i] = sf[i + 1] + a[i];
    }
    int res = 1;
    for(int i = l; i <= r; i++) {
        cur += a[i];
        // cout << a[i] << ' ';
        auto get = [&](bool ok) {
            ll x = cur, t = 0;
            int ret = 0, bf = 0;
            for(int j = i + 1; j <= r; j++) {
                t += a[j];
                if(ok) {
                    if(t > x) {
                        x = t;
                        ret++;
                        bf = max(bf, 1 +ret);
                        ok ^= 1;
                        t = 0;
                    }
                } else {
                    if(t < x) {
                        x = t;
                        ret++;
                        t = 0;
                        ok ^= 1;
                    } else 
                        return bf;
                }
                if(t == 0 && !ok && sf[j + 1] < x) {
                    bf = max(bf, 1 + ret + 1);
                }
            }
            return ret + 1;
        };
        // if(i == 2) {
        //     cout << get(0) << '\n';
        // }
        res = max({res, get(0), get(1)});
    }
    return res;
}
void test() {
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    
    cin >> q;

    for(int i = 1; i <= q; i++) {
        int x, y, l, r;
        cin >> x >> y >> l >> r;
        l++;
        a[x] = y;
        // if(i == 1) continue;
        cout << solve(l, r) << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 

    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    return 0;
}