#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define all(arr) (arr).begin(), (arr).end()
#define ll long long
#define ld long double
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define endl '\n'

const int N = 3e5 + 20;

int t[4 * N];

void modify(int v, int tl, int tr, int pos, int val){
  if (tl == tr){
    t[v] = max(t[v], val);
    return;
  }
  int tm = (tl + tr) / 2;
  if (pos <= tm) modify(2 * v + 1, tl, tm, pos, val);
  else modify(2 * v + 2, tm + 1, tr, pos, val);
  t[v] = max(t[2 * v + 1], t[2 * v + 2]);
}

int query(int v, int tl, int tr, int l, int r){
  if (l > r) return -2;
  if (tl == l && tr == r) return t[v];
  int tm = (tl + tr) / 2;
  return max(
    query(2 * v + 1, tl, tm, l, min(r, tm)),
    query(2 * v + 2, tm + 1, tr, max(l, tm + 1), r)
  );
}

int solve(vector<int> d){
  int n = sz(d);
  d.insert(d.begin(), 0);
  d.pb(0);
  vector<ll> ps(n + 2), dp(n + 2);
  vector<vector<int>> to_add(n + 2);
  for (int i = 1; i <= n + 1; i++) ps[i] = ps[i - 1] + d[i];
  dp[0] = 0, dp[1] = 1;
  for (int i = 0; i < 4 * (n + 2); i++) t[i] = -2;
  modify(0, 0, n + 1, 0, 0);
  for (int i = 1; i <= n; i++){
    // calculate for i + 1
    // then push i
    for (auto j : to_add[i]) modify(0, 0, n + 1, j, dp[j]);
    int idx = (i == n? n + 1 : lower_bound(all(ps), ps[i] - d[i + 1]) - ps.begin() - 1);
    dp[i + 1] = query(0, 0, n + 1, 0, idx) + 2;

    idx = upper_bound(all(ps), d[i] + ps[i]) - ps.begin();
    if (idx <= n + 1) to_add[idx].pb(i);
    // cout << i + 1 << " " << dp[i + 1] << endl;
  }
  return max(dp[n], dp[n + 1] - 1);
}

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  // cout.precision(20);
  int n;
  cin >> n;
  vector<int> d(n);
  for (auto &i : d) cin >> i;
  int q;
  cin >> q;
  while (q--){
    int x, y, a, b;
    cin >> x >> y >> a >> b;
    d[x - 1] = y;
    vector<int> cur;
    for (int i = a; i < b; i++) cur.pb(d[i]);
    cout << solve(cur) << endl;
  }
}