Yaroslav has n points that lie on the Ox axis. The coordinate of the first point is x1, the coordinate of the second point is x2, ..., the coordinate of the n-th point is — xn. Now Yaroslav wants to execute m queries, each of them is of one of the two following types:

  1. Move the pj-th point from position xpj to position xpj + dj. At that, it is guaranteed that after executing such query all coordinates of the points will be distinct. 
  2. Count the sum of distances between all pairs of points that lie on the segment [lj, rj] (lj ≤ rj). In other words, you should count the sum of: <image>. 



Help Yaroslav.

Input

The first line contains integer n — the number of points (1 ≤ n ≤ 105). The second line contains distinct integers x1, x2, ..., xn — the coordinates of points (|xi| ≤ 109).

The third line contains integer m — the number of queries (1 ≤ m ≤ 105). The next m lines contain the queries. The j-th line first contains integer tj (1 ≤ tj ≤ 2) — the query type. If tj = 1, then it is followed by two integers pj and dj (1 ≤ pj ≤ n, |dj| ≤ 1000). If tj = 2, then it is followed by two integers lj and rj ( - 109 ≤ lj ≤ rj ≤ 109).

It is guaranteed that at any moment all the points have distinct coordinates.

Output

For each type 2 query print the answer on a single line. Print the answers in the order, in which the queries follow in the input.

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams of the %I64d specifier.

Examples

Input

8
36 50 28 -75 40 -60 -95 -48
20
2 -61 29
1 5 -53
1 1 429
1 5 130
2 -101 -71
2 -69 53
1 1 404
1 5 518
2 -101 53
2 50 872
1 1 -207
2 -99 -40
1 7 -389
1 6 -171
1 2 464
1 7 -707
1 1 -730
1 1 560
2 635 644
1 7 -677


Output

176
20
406
1046
1638
156
0
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 500;
const long long LOG = 59;
const long long OFF = (1LL << LOG);
long long lo, hi, all, n, q, x, y, ans, p[N];
struct node {
  node *l, *r, *par;
  long long sm, sol;
  long long cnt, rlcnt;
  node() {
    sm = 0, cnt = 0;
    l = NULL, r = NULL, par = NULL;
  }
} * root;
void mrg(node *x) {
  if (x->l == NULL && x->r == NULL) {
    x->sm = 0;
    x->cnt = 0;
    x->sol = 0;
    return;
  }
  if (x->r == NULL) {
    x->sm = x->l->sm;
    x->cnt = x->l->cnt;
    x->sol = x->l->sol;
    return;
  }
  if (x->l == NULL) {
    x->sm = x->r->sm;
    x->cnt = x->r->cnt;
    x->sol = x->r->sol;
    return;
  }
  x->sol = (x->l->cnt) * (x->r->sm) - (x->r->cnt) * (x->l->sm) + x->l->sol +
           x->r->sol;
  x->sm = x->l->sm + x->r->sm;
  x->cnt = x->l->cnt + x->r->cnt;
}
void update(long long x, long long del = 0) {
  x += OFF;
  node *cur = root;
  for (long long j = LOG; j >= 0; j--) {
    if (!(x & (1LL << j))) {
      if (cur->l == NULL) {
        cur->l = new node();
        cur->l->par = cur;
      }
      cur = cur->l;
    } else {
      if (cur->r == NULL) {
        cur->r = new node();
        cur->r->par = cur;
      }
      cur = cur->r;
    }
    if (cur == NULL) cur = new node();
  }
  if (!del) {
    cur->cnt = 1;
    cur->sm = x;
    cur->sol = 0;
  } else {
    cur->cnt = 0;
    cur->sm = 0;
    cur->sol = 0;
  }
  cur = cur->par;
  while (cur != NULL) {
    mrg(cur);
    cur = cur->par;
  }
}
void query(node *x, long long a = 0, long long b = 2 * OFF - 1,
           long long lf = 0, long long ri = 0) {
  if (x == NULL) return;
  if (lo <= a && b <= hi) {
    ans += x->sol;
    ans += (lf - ri) * x->sm;
    return;
  }
  if (a > hi || b < lo) return;
  query(x->l, a, (a + b) / 2, lf, ri + (x->r != NULL ? x->r->rlcnt : 0));
  query(x->r, (a + b) / 2 + 1, b, lf + (x->l != NULL ? x->l->rlcnt : 0), ri);
}
void query2(node *x, long long a = 0, long long b = 2 * OFF - 1) {
  if (x == NULL) return;
  if (lo <= a && b <= hi) {
    x->rlcnt = x->cnt;
    return;
  }
  if (a > hi || b < lo) {
    x->rlcnt = 0;
    return;
  }
  query2(x->l, a, (a + b) / 2);
  query2(x->r, (a + b) / 2 + 1, b);
  x->rlcnt =
      (x->l != NULL ? x->l->rlcnt : 0) + (x->r != NULL ? x->r->rlcnt : 0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  root = new node();
  cin >> n;
  for (long long i = 0; i < n; i++) {
    long long x;
    cin >> x;
    p[i] = x;
    update(x);
  }
  cin >> q;
  for (long long i = 0; i < q; i++) {
    long long typ;
    cin >> typ;
    if (typ == 1) {
      cin >> x >> y;
      x--;
      update(p[x], 1);
      update(p[x] + y);
      p[x] += y;
    } else {
      cin >> lo >> hi;
      lo += OFF, hi += OFF;
      ans = 0, query2(root), query(root);
      cout << ans << "\n";
    }
  }
}
