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

#define int ll
int n, a[N], q, dp[N];
ll inf = 1e18;
int solve(int l, int r, int id = -1) {
    dp[l - 1] = 0;
    for(int i = l; i <= r; ++i) {
        ll T = 0;
        if(i == l) {
            dp[i] = 1;
        }
        for(int j = i - 1; j >= l; j--) {
            T += a[j];
            if(T > a[i] && (j == l || T > a[j - 1])) {
                dp[i] = max(dp[i], dp[j - 1] + 2);
            }
        }
    }
    int res = max(1ll, dp[r]);
    ll cur = a[r];
    for(int i = r - 1; i >= l; i--) {
        if(cur > a[i]) {
            res = max(res, 1 + dp[i]);
        }
    }
    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;
        cout << solve(l, r, i) << '\n';
    }
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 

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