#include <bits/stdc++.h>

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n;
    std::vector<int> input(n);
    for (auto& i : input) {
        std::cin >> i;
    }
    int q;
    std::cin >> q;
    std::vector<std::array<int, 4>> quer(q);
    for (auto& [x, y, l, r] : quer) {
        std::cin >> x >> y >> l >> r;
        x--;
    }

    std::vector<int> ans(q);
    for (int i = 0; i < q; i++) {
        auto& [x, y, l, r] = quer[i];
        input[x] = y;
        std::vector<int> vec(input.begin() + l, input.begin() + r);
        int n = vec.size();
        std::vector<int> dp(n, -1e8);
        dp[0] = 1;
        constexpr int K = 35;
        constexpr int K0 = 65;
        for (int i = 0; i < std::min(n, K0); i++) {
            if (std::accumulate(vec.begin(), vec.begin() + i, 0ll) > vec[i]) {
                dp[i] = 2;
            }
        }
        for (int i = 0; i < n; i++) {
            int64_t sum = 0;
            int val = dp[i];
            for (int j = i - 1; j > std::max(0, i - K); j--) {
                sum += vec[j];
                if (vec[i] < sum && vec[j - 1] < sum) {
                    val = std::max(val, dp[j - 1] + 2);
                }
            }
            dp[i] = val;
        }
        int& res = ans[i];
        res = std::max(1, dp[n - 1]);
        for (int i = std::max(0, n - K0); i < n; i++) {
            if (std::accumulate(vec.begin() + i + 1, vec.begin() + n, 0ll) > vec[i]) {
                res = std::max(res, dp[i] + 1);
            }
        }
    }

    for (int i = 0; i < q; i++) {
        std::cout << ans[i] << "\n";
    }

    return 0;
}