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;
struct node {
  node *L, *R;
  long long n, x, s;
  node() {
    L = NULL;
    R = NULL;
    n = 0;
    x = 0;
    s = 0;
  }
  void updt() {
    if (!L) L = new node();
    if (!R) R = new node();
    n = L->n + R->n;
    s = L->s + R->s;
    x = L->x + R->x + L->n * R->s - R->n * L->s;
  }
};
long long wi, wn;
void updt(long long l, long long r, node *&x) {
  if (wi < l || r - 1 < wi) return;
  if (!x) x = new node();
  if (l == r - 1) {
    x->n = wn;
    if (wn == 1)
      x->s = l;
    else
      x->s = 0;
    x->x = 0;
    return;
  }
  updt(l, (l + r) / 2, x->L);
  updt((l + r) / 2, r, x->R);
  x->updt();
}
struct ret {
  long long n, s, x;
};
ret join(ret L, ret R) {
  ret p;
  p.n = L.n + R.n;
  p.s = L.s + R.s;
  p.x = L.x + R.x + L.n * R.s - R.n * L.s;
  return p;
}
long long wl, wr;
ret go(long long l, long long r, node *&x) {
  if (wr < l || r - 1 < wl) return {0, 0, 0};
  if (!x) return {0, 0, 0};
  if (wl <= l && r - 1 <= wr) return {x->n, x->s, x->x};
  ret L, R;
  L = go(l, (l + r) / 2, x->L);
  R = go((l + r) / 2, r, x->R);
  return join(L, R);
}
long long a[int(1e6 + 500)];
int main() {
  long long n, k, v, rt, q, t;
  node *root = NULL;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> wi;
    a[i] = wi;
    wn = 1;
    updt(-((long long)(1e9 + 100)), ((long long)(1e9 + 100)), root);
  }
  cin >> q;
  while (q--) {
    cin >> t >> wl >> wr;
    if (t == 1) {
      wn = 0;
      wi = a[wl];
      updt(-((long long)(1e9 + 100)), ((long long)(1e9 + 100)), root);
      a[wl] += wr;
      wn = 1;
      wi = a[wl];
      updt(-((long long)(1e9 + 100)), ((long long)(1e9 + 100)), root);
    } else {
      cout << go(-((long long)(1e9 + 100)), ((long long)(1e9 + 100)), root).x
           << endl;
    }
  }
  return 0;
}
