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 maxn = 1e5 + 10;
long long cnt[maxn << 3], sum[maxn << 3], ans[maxn << 3], val;
long long d[maxn], dd[maxn], p[maxn << 2], x[maxn], y[maxn], xx, yy;
int n, m, len, op[maxn], t, id;
struct triple {
  long long x, y, z;
  triple(long long x = 0, long long y = 0, long long z = 0)
      : x(x), y(y), z(z) {}
};
void maintian(int o, int l, int r) {
  int ls = (o << 1), rs = ((o << 1) | 1);
  cnt[o] = cnt[ls] + cnt[rs];
  sum[o] = sum[ls] + sum[rs];
  ans[o] = sum[rs] * cnt[ls] - sum[ls] * cnt[rs] + ans[ls] + ans[rs];
}
void build(int o, int l, int r) {
  if (l == r) {
    ;
  }
  if (l < r) {
    int ls = (o << 1), rs = ((o << 1) | 1);
    int m = l + ((r - l) >> 1);
    build(ls, l, m);
    build(rs, m + 1, r);
    maintian(o, l, r);
  }
}
void update(int o, int l, int r) {
  if (l == r) {
    if (t == 1) {
      cnt[o] = 1;
      sum[o] = val;
      ans[o] = 0;
    } else {
      cnt[o] = 0;
      sum[o] = 0;
      ans[o] = 0;
    }
  } else {
    int ls = (o << 1), rs = ((o << 1) | 1);
    int m = l + ((r - l) >> 1);
    if (id <= m)
      update(ls, l, m);
    else
      update(rs, m + 1, r);
    maintian(o, l, r);
  }
}
triple query(int o, int l, int r) {
  if (xx <= l && yy >= r) {
    return triple(cnt[o], sum[o], ans[o]);
  } else {
    int ls = (o << 1), rs = ((o << 1) | 1);
    int m = l + ((r - l) >> 1);
    triple tl, tr;
    if (xx <= m) tl = query(ls, l, m);
    if (yy > m) tr = query(rs, m + 1, r);
    return triple(tl.x + tr.x, tl.y + tr.y,
                  tr.y * tl.x - tr.x * tl.y + tl.z + tr.z);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", d + i);
    p[++len] = dd[i] = d[i];
  }
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    scanf("%d%I64d%I64d", op + i, x + i, y + i);
    if (op[i] == 1) {
      p[++len] = (d[x[i]] = d[x[i]] + y[i]);
    } else {
      p[++len] = x[i];
      p[++len] = y[i];
    }
  }
  sort(p + 1, p + len + 1);
  len = (unique(p + 1, p + len + 1) - p - 1);
  for (int i = 1; i <= n; i++) {
    t = 1;
    id = lower_bound(p + 1, p + 1 + len, dd[i]) - p;
    val = dd[i];
    update(1, 1, len);
  }
  for (int i = 0; i < m; i++) {
    if (op[i] == 1) {
      t = 2;
      id = lower_bound(p + 1, p + len + 1, dd[x[i]]) - p;
      update(1, 1, len);
      t = 1;
      dd[x[i]] += y[i];
      val = dd[x[i]];
      id = lower_bound(p + 1, p + len + 1, dd[x[i]]) - p;
      update(1, 1, len);
    } else {
      xx = lower_bound(p + 1, p + len + 1, x[i]) - p;
      yy = lower_bound(p + 1, p + len + 1, y[i]) - p;
      triple tmp = query(1, 1, len);
      printf("%I64d\n", tmp.z);
    }
  }
  return 0;
}
