#include <bits/stdc++.h>
using namespace std;
long long const MN = 1e5 + 100, INF = 2e9 + 100;
long long n, q, lst = 2, a[MN];
struct node {
  node *L, *R;
  long long sum, cnt, ans;
  node() {
    L = R = NULL;
    ans = cnt = sum = 0;
  }
} root, zero;
void make(node &a) {
  if (a.L == NULL) a.L = new node();
  if (a.R == NULL) a.R = new node();
}
node merge(node ret, node a, node b) {
  ret.sum = a.sum + b.sum;
  ret.cnt = a.cnt + b.cnt;
  ret.ans = a.ans + b.ans + a.cnt * b.sum - b.cnt * a.sum;
  return ret;
}
void upd(long long ind, long long k, long long l = -INF, long long r = INF,
         node &C = root) {
  if (ind < l || ind >= r) return;
  if (r - l == 1) {
    C.ans = 0;
    C.cnt += k;
    C.sum += k * ind;
    return;
  }
  make(C);
  long long m = (l + r) / 2;
  upd(ind, k, l, m, *C.L), upd(ind, k, m, r, *C.R);
  C = merge(C, *C.L, *C.R);
}
node get(long long s, long long e, long long l = -INF, long long r = INF,
         node &C = root) {
  if (l >= e || r <= s) return zero;
  if (l >= s && r <= e) return C;
  long long m = (l + r) / 2;
  node rl, rr;
  if (C.L != NULL) rl = get(s, e, l, m, *C.L);
  if (C.R != NULL) rr = get(s, e, m, r, *C.R);
  return merge(C, rl, rr);
}
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    upd(a[i], 1);
  }
  cin >> q;
  while (q--) {
    long long ch, l, r, i, d;
    cin >> ch;
    if (ch == 1) {
      cin >> i >> d;
      i--;
      upd(a[i], -1);
      a[i] += d;
      upd(a[i], 1);
    } else {
      cin >> l >> r;
      cout << get(l, r + 1).ans << '\n';
    }
  }
}
