#include <bits/stdc++.h>
using namespace std;
struct Node {
  long long cnt, sum, ans;
  int ls, rs;
  Node() { cnt = sum = ans = ls = rs = 0; }
} c[5000005], zero;
int n, m, x[500005], vvv = 1;
Node merge(Node A, Node B, Node C) {
  C.cnt = A.cnt + B.cnt;
  C.sum = A.sum + B.sum;
  C.ans = A.cnt * B.sum - B.cnt * A.sum + A.ans + B.ans;
  return C;
}
void add(int v, int z, int p, int l, int r) {
  if (l > v || r < v) return;
  if (l == r) {
    c[p].sum += v * z, c[p].cnt += z, c[p].ans = 0;
    return;
  }
  if (!c[p].ls) c[p].ls = ++vvv;
  if (!c[p].rs) c[p].rs = ++vvv;
  int mid = l + r >> 1;
  if (mid >= v) add(v, z, c[p].ls, l, mid);
  if (mid < v) add(v, z, c[p].rs, mid + 1, r);
  c[p] = merge(c[c[p].ls], c[c[p].rs], c[p]);
}
Node query(int x, int y, int p, int l, int r) {
  if (x <= l && r <= y) return c[p];
  int mid = l + r >> 1;
  Node A, B;
  if (mid >= x) A = query(x, y, c[p].ls, l, mid);
  if (mid < y) B = query(x, y, c[p].rs, mid + 1, r);
  return merge(A, B, c[p]);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x[i]);
    add(x[i], 1, 1, -1000000001, 1000000001);
  }
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    int od;
    scanf("%d", &od);
    if (od == 1) {
      int a, b;
      scanf("%d%d", &a, &b);
      add(x[a], -1, 1, -1000000001, 1000000001);
      x[a] += b;
      add(x[a], 1, 1, -1000000001, 1000000001);
    } else {
      int a, b;
      scanf("%d%d", &a, &b);
      printf("%lld\n", query(a, b, 1, -1000000001, 1000000001).ans);
    }
  }
  return 0;
}
