#include <bits/stdc++.h>
using namespace std;
template <typename T, size_t N>
int size(const T (&t)[N]) {
  return N;
}
template <typename T>
int size(const T &t) {
  return t.size();
}
string to_string(const string s, int x1 = 0, int x2 = 1e9) {
  return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char c) { return string({c}); }
template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
  string t = "";
  for (int __iii__ = min(x1, size(b)), __jjj__ = min(x2, size(b) - 1);
       __iii__ <= __jjj__; ++__iii__) {
    t += b[__iii__] + '0';
  }
  return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  l_v_l_v_l++;
  string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
  l_v_l_v_l--;
  return res;
}
template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
  int rnk = rank<A>::value;
  string tab(t_a_b_s, ' ');
  string res = "";
  bool first = true;
  if (l_v_l_v_l == 0) res += '\n';
  res += tab + "[";
  x1 = min(x1, size(v)), x2 = min(x2, size(v));
  auto l = begin(v);
  advance(l, x1);
  auto r = l;
  advance(r, (x2 - x1) + (x2 < size(v)));
  for (auto e = l; e != r; e = next(e)) {
    if (!first) {
      res += ", ";
    }
    first = false;
    l_v_l_v_l++;
    if (e != l) {
      if (rnk > 1) {
        res += '\n';
        t_a_b_s = l_v_l_v_l;
      };
    } else {
      t_a_b_s = 0;
    }
    res += to_string(*e, coords...);
    l_v_l_v_l--;
  }
  res += "]";
  if (l_v_l_v_l == 0) res += '\n';
  return res;
}
template <typename A, size_t N>
string to_string(const A (&v)[N], int x2) {
  return to_string(v, 0, x2);
}
void dbgm() { ; }
template <typename Heads, typename... Tails>
void dbgm(Heads H, Tails... T) {
  cout << to_string(H) << " | ";
  dbgm(T...);
}
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const double EPS = 1e-9;
const int MAXN = 1e5 + 5;
long long a[MAXN], d[MAXN], a0, sumPos;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (i > 0) {
      d[i] = a[i] - a[i - 1];
    } else {
      d[i] = a[i];
    }
  }
  a0 = d[0];
  for (int i = 1; i < n; i++) {
    if (d[i] > 0) {
      sumPos += d[i];
    }
  }
  long long tmp = a0 + sumPos;
  cout << (tmp % 2 == 0 ? tmp / 2 : (tmp + 1) / 2) << '\n';
  int q;
  cin >> q;
  for (int qq = 0; qq < q; qq++) {
    int l, r;
    long long x;
    cin >> l >> r >> x;
    l--;
    r--;
    if (l == 0) {
      a0 += x;
    } else {
      if (d[l] > 0) {
        sumPos -= d[l];
      }
      d[l] += x;
      if (d[l] > 0) {
        sumPos += d[l];
      }
    }
    if (r + 1 < n) {
      if (d[r + 1] > 0) {
        sumPos -= d[r + 1];
      }
      d[r + 1] -= x;
      if (d[r + 1] > 0) {
        sumPos += d[r + 1];
      }
    }
    long long tmp = a0 + sumPos;
    cout << (tmp % 2 == 0 ? tmp / 2 : (tmp + 1) / 2) << '\n';
  }
  return 0;
}
