#include <bits/stdc++.h>
using namespace std;
long long spf[11];
long long fac[11];
void sieve() {
  spf[1] = 1;
  for (long long i = 2; i < 11; i++) spf[i] = i;
  for (long long i = 4; i < 11; i += 2) spf[i] = 2;
  for (long long i = 3; i * i < 11; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 11; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<long long, long long> getfactor(long long a) {
  map<long long, long long> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0 || y < 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inverse(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r > n) return 0;
  if (r == 0 || r == n) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
void solve() {
  long long n;
  cin >> n;
  long long a[n + 1];
  for (long long i = 1; i <= n; i++) cin >> a[i];
  long long diff[n + 1];
  for (long long i = 2; i <= n; i++) diff[i] = a[i] - a[i - 1];
  long double sum = 0;
  for (long long i = 2; i <= n; i++) sum += max(diff[i], 0ll);
  long double as = a[1] - (a[1] - sum) / 2;
  as = ceil(as);
  cout << (long long)as << '\n';
  long long q;
  cin >> q;
  while (q--) {
    long long l, r, x;
    cin >> l >> r >> x;
    long long tot = 0;
    if (l != 1) tot += max(diff[l], 0ll);
    if (r != n) tot += max(diff[r + 1], 0ll);
    sum -= tot;
    if (r != n) {
      diff[r + 1] -= x;
      sum += max(diff[r + 1], 0ll);
    }
    if (l != 1) {
      diff[l] += x;
      sum += max(diff[l], 0ll);
    }
    if (l <= 1) a[1] += x;
    as = a[1] - (a[1] - sum) / 2;
    as = ceil(as);
    if (as > -1 && as < 1) as = 0;
    cout << (long long)as << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long test = 1;
  while (test--) {
    solve();
  }
}
