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 int MX = 1 << 19;
struct node {
  long long left, right, cnt, tot, length;
};
struct segtree {
  node t[MX * 2];
  node merge(node& l, node& r) {
    node ans;
    ans.left = l.left + r.left + l.length * r.cnt;
    ans.right = l.right + r.right + r.length * l.cnt;
    ans.cnt = l.cnt + r.cnt;
    ans.length = l.length + r.length;
    ans.tot = l.tot + r.tot + l.right * r.cnt + r.left * l.cnt;
    return ans;
  }
  void update(int wi, int su) {
    wi += MX;
    t[wi].cnt = su;
    while (wi > 1) {
      wi /= 2;
      t[wi] = merge(t[wi * 2], t[wi * 2 + 1]);
    }
  }
  long long read(int s, int e) {
    s += MX, e += MX;
    node l = {0}, r = {0};
    while (s <= e) {
      if (s & 1)
        l = merge(l, t[s]), s = s / 2 + 1;
      else
        s /= 2;
      if (e & 1)
        e /= 2;
      else
        r = merge(t[e], r), e = e / 2 - 1;
    }
    return merge(l, r).tot;
  }
} t;
struct query {
  long long o, s, e;
} Q[MX];
map<long long, long long> point;
long long D[MX], tmp[MX];
int main() {
  int N, T;
  scanf("%d", &N);
  for (int i = 1; i <= N; i++)
    scanf("%lld", D + i), tmp[i] = D[i], point[D[i]] = 0;
  scanf("%d", &T);
  for (int i = 0; i < T; i++) scanf("%lld%lld%lld", &Q[i].o, &Q[i].s, &Q[i].e);
  for (int i = 0; i < T; i++) {
    if (Q[i].o == 2) continue;
    tmp[Q[i].s] += Q[i].e;
    point[tmp[Q[i].s]] = 0;
  }
  int wi = 0;
  for (auto it = point.begin(), it2 = point.begin(); it != point.end();
       ++it, wi++) {
    it->second = wi * 2;
    ++it2;
    if (it2 != point.end())
      t.t[MX + wi * 2 + 1].length = it2->first - it->first;
  }
  for (int i = MX - 1; i >= 1; i--) {
    t.t[i].length = t.t[i * 2].length + t.t[i * 2 + 1].length;
  }
  for (int i = 1; i <= N; i++) {
    t.update(point[D[i]], 1);
  }
  for (int i = 0; i < T; i++) {
    if (Q[i].o == 1) {
      t.update(point[D[Q[i].s]], 0);
      D[Q[i].s] += Q[i].e;
      t.update(point[D[Q[i].s]], 1);
    } else {
      auto l = point.lower_bound(Q[i].s), r = point.upper_bound(Q[i].e);
      if (r == l)
        printf("0 \n");
      else
        --r, printf("%lld\n", t.read(l->second, r->second));
    }
  }
  return 0;
}
