#include <bits/stdc++.h>
using namespace std;
const long long inf = (1ll << 60);
const int MX = 300009;
struct node {
  int ans, suff, pref, sz, prefc, suffc;
  node() {}
  node(long long V) {
    sz = 1;
    if (V == 0) suff = pref = ans = prefc = suffc = 0;
    if (V > 0) suff = pref = ans = prefc = suffc = 1;
    if (V < 0) {
      suff = pref = ans = 1;
      prefc = suffc = -1;
    }
  }
} tree[MX * 4];
long long arr[MX], val;
long long st, en, n, A[MX], Node[MX];
node merge_(node left, node right) {
  node ret;
  ret.sz = left.sz + right.sz;
  ret.prefc = left.prefc;
  ret.suffc = right.suffc;
  ret.pref = left.pref;
  ret.suff = right.suff;
  if ((left.suffc == 1 || (left.suffc == -1 && right.prefc == -1))) {
    if (left.ans == left.sz)
      if (right.prefc) ret.pref += right.pref;
  }
  if ((right.prefc == -1 || (left.suffc == 1 && right.prefc == 1))) {
    if (right.ans == right.sz)
      if (left.suffc) ret.suff += left.suff;
  }
  ret.ans = max(left.ans, right.ans);
  if ((left.suffc == 1 || (left.suffc == -1 && right.prefc == -1)) &&
      ((right.prefc != 0)))
    ret.ans = max(ret.ans, left.suff + right.pref);
  return ret;
}
void build(int x, int a, int b) {
  if (a == b) {
    Node[a] = x;
    tree[x] = node(A[a]);
    return;
  }
  build(x * 2, a, (a + b) / 2);
  build(x * 2 + 1, (a + b) / 2 + 1, b);
  tree[x] = merge_(tree[x * 2], tree[x * 2 + 1]);
}
void up(int ind) {
  int x = Node[ind];
  tree[x] = node(A[ind]);
  x /= 2;
  while (x) {
    tree[x] = merge_(tree[x * 2], tree[x * 2 + 1]);
    x /= 2;
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int j = 1; j <= n; j++) scanf("%d", &arr[j]);
  int Q;
  scanf("%d", &Q);
  if (n == 1) {
    while (Q--) puts("1");
    return 0;
  }
  for (int i = 1; i < n; i++) A[i] = arr[i + 1] - arr[i];
  n--;
  build(1, 1, n);
  while (Q--) {
    scanf("%d%d%d", &st, &en, &val);
    if (st != 1) {
      A[st - 1] += val;
      up(st - 1);
    }
    if (en != n + 1) {
      A[en] -= val;
      up(en);
    }
    printf("%d\n", tree[1].ans + 1);
  }
}
