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>
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) x = (x << 3) + (x << 1) + c - 48, c = getchar();
  return x * f;
}
const int N = 1e5 + 7, M = 5e6 + 7;
int n, m, root, cnt, ls[M], rs[M];
long long pos[N];
std::map<long long, bool> mp;
struct node {
  int sz;
  long long s1, s2;
} tr[M];
void pushup(int rt) {
  tr[rt].sz = tr[ls[rt]].sz + tr[rs[rt]].sz;
  tr[rt].s1 = tr[ls[rt]].s1 + tr[rs[rt]].s1;
  tr[rt].s2 = tr[ls[rt]].s2 + tr[rs[rt]].s2 + tr[rs[rt]].s1 * tr[ls[rt]].sz -
              tr[ls[rt]].s1 * tr[rs[rt]].sz;
}
void mdf(int &rt, int l, int r, int loc, int val, bool flag) {
  if (!rt) rt = ++cnt;
  if (l == r) {
    if (flag == 0)
      tr[rt].s1 -= val;
    else
      tr[rt].s1 += val;
    if (flag == 0)
      tr[rt].sz--;
    else
      tr[rt].sz++;
    return;
  }
  int mid = (1ll * l + r) >> 1;
  if (loc <= mid)
    mdf(ls[rt], l, mid, loc, val, flag);
  else
    mdf(rs[rt], mid + 1, r, loc, val, flag);
  pushup(rt);
}
node qry(int rt, int l, int r, int L, int R) {
  if (!rt) return (node){0, 0, 0};
  if (L <= l && r <= R) return tr[rt];
  int mid = (1ll * l + r) >> 1;
  node lret = (node){0, 0, 0}, rret = (node){0, 0, 0};
  if (L <= mid) lret = qry(ls[rt], l, mid, L, R);
  if (R > mid) rret = qry(rs[rt], mid + 1, r, L, R);
  node ret;
  ret.sz = lret.sz + rret.sz;
  ret.s1 = lret.s1 + rret.s1;
  ret.s2 = lret.s2 + rret.s2 + rret.s1 * lret.sz - lret.s1 * rret.sz;
  return ret;
}
signed main() {
  n = read();
  for (int i = 1; i <= n; ++i)
    pos[i] = read(), mp[pos[i]] = 1,
    mdf(root, 1, 2e9 + 1, pos[i] + 1e9 + 1, pos[i], 1);
  m = read();
  while (m-- > 0) {
    int op = read(), l = read(), r = read();
    if (op == 2)
      printf("%I64d\n", qry(root, 1, 2e9 + 1, l + 1e9 + 1, r + 1e9 + 1).s2);
    else {
      if (abs(pos[l]) <= 1e9)
        mdf(root, 1, 2e9 + 1, pos[l] + 1e9 + 1, pos[l], 0);
      mp[pos[l]] = 0;
      pos[l] += r;
      if (mp[pos[l]]) return -1;
      mp[pos[l]] = 1;
      if (abs(pos[l]) <= 1e9)
        mdf(root, 1, 2e9 + 1, pos[l] + 1e9 + 1, pos[l], 1);
    }
  }
  return 0;
}
