#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimization("O3")
using namespace std;
const long long N = 1e5 + 10, LOG = 26, M = 2e9 + 10, Mod = 1e9 + 9;
struct node {
  long long sum, cnt, ans;
  node* lc;
  node* rc;
  node() : lc(NULL), rc(NULL), ans(0), sum(0), cnt(0) {}
  node(long long ans, long long sum, long long cnt)
      : lc(NULL), rc(NULL), ans(ans), sum(sum), cnt(cnt) {}
};
void merge(node* it) {
  it->sum = it->lc->sum + it->rc->sum;
  it->ans = it->lc->ans + it->rc->ans + it->rc->sum * it->lc->cnt -
            it->lc->sum * it->rc->cnt;
  it->cnt = it->lc->cnt + it->rc->cnt;
}
void make(node* it) {
  if (it->lc == NULL) {
    node* x = new node;
    it->lc = x;
  }
  if (it->rc == NULL) {
    node* x = new node;
    it->rc = x;
  }
}
void ins(long long p, node* it, long long l = -M, long long r = M) {
  if (r - l < 2) {
    it->ans = 0;
    it->cnt = 1;
    it->sum = p;
    return;
  }
  make(it);
  long long mid = (l + r) / 2;
  if (p < mid)
    ins(p, it->lc, l, mid);
  else
    ins(p, it->rc, mid, r);
  merge(it);
}
void del(long long p, node* it, long long l = -M, long long r = M) {
  if (r - l < 2) {
    it->ans = it->cnt = it->sum = 0;
    return;
  }
  make(it);
  long long mid = (l + r) / 2;
  if (p < mid)
    del(p, it->lc, l, mid);
  else
    del(p, it->rc, mid, r);
  merge(it);
}
node que(long long s, long long e, node* it, long long l = -M,
         long long r = M) {
  if (s <= l && r <= e) return *it;
  if (r <= s || e <= l) return node(0, 0, 0);
  make(it);
  long long mid = (l + r) / 2;
  node a = que(s, e, it->lc, l, mid);
  node b = que(s, e, it->rc, mid, r);
  return node(a.ans + b.ans + b.sum * a.cnt - a.sum * b.cnt, a.sum + b.sum,
              a.cnt + b.cnt);
}
long long point[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  node* root = new node;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> point[i];
    ins(point[i], root);
  }
  int q;
  cin >> q;
  while (q--) {
    int t;
    cin >> t;
    if (t == 1) {
      int p, d;
      cin >> p >> d;
      p--;
      del(point[p], root);
      point[p] += d;
      ins(point[p], root);
    } else {
      int l, r;
      cin >> l >> r;
      r++;
      cout << que(l, r, root).ans << '\n';
    }
  }
}
