#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 25e4 + 10, MAXM = 5e4 + 10;
const int MAXB = 70, B = 65, INF = 1e6;

int n, q, a[MAXN];
int nxt[MAXN];

struct Node
{
    int l, r;
    int d[MAXB], p[MAXB];
    void Clear() {for (int i = 0; i <= B; i++) d[i] = 0, p[i] = INF;}
    Node operator + (const Node a) const
    {
        // cout << l << " " << r << " " << a.l << " " << a.r << "\n";
        Node b;
        b.l = l, b.r = a.r;
        for (int i = 0; i <= B; i++)
        {
            if (l + i <= r)
            {
                if (p[i] == INF) b.d[i] = 0, b.p[i] = INF;
                else if (a.p[p[i] - r - 1] == INF) b.d[i] = d[i], b.p[i] = p[i];
                else b.d[i] = d[i] + a.d[p[i] - r - 1], b.p[i] = a.p[p[i] - r - 1];
            }
            else b.d[i] = a.d[l + i - r - 1], b.p[i] = a.p[l + i - r - 1];
            // cout << b.d[i] << " " << b.p[i] << "\n";
        }
        return b;
    }
}tr[MAXN << 2];
void Update(int cur, int l, int r, int x, int y)
{
    if (l == r) tr[cur].Clear(), tr[cur].l = tr[cur].r = l, tr[cur].d[0] = (nxt[l] != INF), tr[cur].p[0] = nxt[l];
    else
    {
        int mid = l + r >> 1;
        if (x <= mid) Update(cur << 1, l, mid, x, y);
        if (y > mid) Update(cur << 1 | 1, mid + 1, r, x, y);
        tr[cur] = tr[cur << 1] + tr[cur << 1 | 1];
    }
}
Node Query(int cur, int l, int r, int x, int y)
{
    if (x <= l && r <= y) return tr[cur];
    int mid = l + r >> 1;
    if (y <= mid) return Query(cur << 1, l, mid, x, y);
    if (x > mid) return Query(cur << 1 | 1, mid + 1, r, x, y);
    return Query(cur << 1, l, mid, x, y) + Query(cur << 1 | 1, mid + 1, r, x, y);
}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n);
    for (int i = 1; i <= n; i++) Read(a[i]);
    nxt[n + 1] = 1e6;
    for (int i = n; i >= 0; i--)
    {
        nxt[i] = nxt[i + 1];
        int sum = 0;
        for (int j = i + 1; j <= n && j <= i + B; j++)
        {
            sum += a[j];
            if (sum > a[i] && sum > a[j + 1]) {nxt[i] = min(nxt[i], j + 1); break;}
        }
    }
    Update(1, 0, n, 0, n);
    Read(q);
    int x, k, l, r;
    while (q--)
    {
        Read(x), Read(k), Read(l), Read(r);
        a[x] = k;
        for (int i = x; i >= x - B && i >= 0; i--)
        {
            nxt[i] = nxt[i + 1];
            int sum = 0;
            for (int j = i + 1; j <= n && j <= i + B; j++)
            {
                sum += a[j];
                if (sum > a[i] && sum > a[j + 1]) {nxt[i] = min(nxt[i], j + 1); break;}
            }
        }
        Update(1, 0, n, max(0, x - B), x);
        int L = ++l, R = r, sum = 0;
        while (L <= r && sum <= a[L]) sum += a[L++];
        sum = 0;
        while (R >= l && sum <= a[R]) sum += a[R--];
        auto res = Query(1, 0, n, l, r);
        int ans = max(1, res.d[0] * 2 - 1);
        if (L <= r) res = Query(1, 0, n, L, r), ans = max(ans, res.d[0] * 2);
        if (l <= R) res = Query(1, 0, n, l, R), ans = max(ans, res.d[0] * 2);
        if (L <= R) res = Query(1, 0, n, L, R), ans = max(ans, res.d[0] * 2 + 1);
        Write(ans, '\n');
    }
    return 0;
}