#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
int n;
long long int d[MAXN], st[2 * MAXN];
long long int arr(int i) {
  if (i == 0 || i == n - 1) return 0;
  return max(0ll, -d[i - 1]) + max(0ll, d[i]);
}
void build() {
  for (int i = 0; i < n; ++i) st[i + n] = arr(i);
  for (int i = n - 1; i > 0; --i) st[i] = min(st[2 * i], st[2 * i + 1]);
}
long long int query(int l, int r) {
  long long int res = LLONG_MAX;
  for (l += n, r += n; l < r; l /= 2, r /= 2) {
    if (l & 1) res = min(res, st[l++]);
    if (r & 1) res = min(res, st[--r]);
  }
  return res;
}
void update(int idx) {
  st[idx + n] = arr(idx);
  for (int i = idx + n; i > 1; i /= 2) st[i / 2] = min(st[i], st[i ^ 1]);
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  long long int sum = 0;
  int a1, a2;
  cin >> a1;
  for (int i = 0; i < n - 1; ++i)
    cin >> a2, d[i] = a2 - a1, sum += abs(d[i]), a1 = a2;
  int q;
  cin >> q;
  build();
  while (q--) {
    int t, l, r;
    long long int x;
    cin >> t >> l >> r >> x;
    l--, r--;
    if (t == 1) {
      long long int res = sum + (l == r ? abs(d[l - 1] + x) - abs(d[l - 1]) +
                                              abs(d[l] - x) - abs(d[l])
                                        : max(0ll, 2 * (x - query(l, r + 1))));
      cout << res << endl;
    } else {
      for (int i : {l - 1, r})
        sum -= abs(d[i]), d[i] += (i == l - 1 ? x : -x), sum += abs(d[i]);
      for (int i : {l - 1, l, r, r + 1}) update(i);
    }
  }
}
