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>
struct NODE {
  NODE* ch[2];
  long long l, r;
  int pnum;
  long long sum;
  long long lsum, rsum;
  NODE() {
    pnum = sum = lsum = rsum = 0;
    ch[0] = ch[1] = NULL;
  }
  NODE(long long cl, long long cr) {
    l = cl;
    r = cr;
    pnum = sum = lsum = rsum = 0;
    ch[0] = ch[1] = NULL;
  }
  inline void expand() {
    if (ch[0] != NULL) return;
    if (l >= r) return;
    long long mid = (l == r - 1) ? l : 1ll * (l + r) / 2;
    ch[0] = new NODE(l, mid);
    ch[1] = new NODE(mid + 1, r);
  }
  void maintain() {
    pnum = ch[0]->pnum + ch[1]->pnum;
    lsum = ch[0]->lsum;
    lsum += ch[1]->lsum + 1ll * ch[1]->pnum * (ch[0]->r - ch[0]->l + 1);
    rsum = ch[1]->rsum;
    rsum += ch[0]->rsum + 1ll * ch[0]->pnum * (ch[1]->r - ch[1]->l + 1);
    sum = ch[0]->sum + ch[1]->sum;
    sum += ch[0]->rsum * ch[1]->pnum + ch[1]->lsum * ch[0]->pnum +
           1ll * ch[0]->pnum * ch[1]->pnum;
  }
  void ins(long long pos) {
    if (l > pos || r < pos) return;
    if (l == r && l == pos) {
      pnum++;
      return;
    }
    expand();
    ch[0]->ins(pos);
    ch[1]->ins(pos);
    maintain();
  }
  void del(long long pos) {
    if (l > pos || r < pos) return;
    if (l == r && l == pos) {
      pnum--;
      return;
    }
    ch[0]->del(pos);
    ch[1]->del(pos);
    maintain();
    if (ch[0]->pnum == 0 && ch[1]->pnum == 0) {
      delete ch[0];
      delete ch[1];
      ch[0] = ch[1] = NULL;
    }
  }
  long long count(long long cl, long long cr, int& cpnum, long long& clsum,
                  long long& crsum) {
    if (cr < l || cl > r) {
      cpnum = clsum = crsum = 0;
      return 0;
    }
    if (cl <= l && cr >= r) {
      cpnum = pnum;
      clsum = lsum;
      crsum = rsum;
      return sum;
    }
    expand();
    int cpnum_1;
    long long clsum_1, crsum_1;
    int cpnum_2;
    long long clsum_2, crsum_2;
    long long ans = ch[0]->count(cl, cr, cpnum_1, clsum_1, crsum_1) +
                    ch[1]->count(cl, cr, cpnum_2, clsum_2, crsum_2);
    ans += crsum_1 * cpnum_2 + clsum_2 * cpnum_1 + 1ll * cpnum_2 * cpnum_1;
    cpnum = cpnum_1 + cpnum_2;
    clsum = clsum_1 + clsum_2 + cpnum_2 * (ch[0]->r - ch[0]->l + 1);
    crsum = crsum_1 + crsum_2 + cpnum_1 * (ch[1]->r - ch[1]->l + 1);
    return ans;
  }
};
int main() {
  NODE* root = new NODE(-5010001000ll, 5010001000ll);
  int n, m;
  scanf("%d", &n);
  int x[101000];
  for (int i = 1; i <= n; i++) {
    scanf("%d", x + i);
    root->ins(x[i]);
    if (x[i] < -5010001000ll || x[i] > 5010001000ll)
      while (1) {
        int p;
        p++;
      }
  }
  scanf("%d", &m);
  while (m--) {
    int t, u, v;
    scanf("%d%d%d", &t, &u, &v);
    if (t == 1) {
      root->del(x[u]);
      x[u] += v;
      root->ins(x[u]);
      if (x[u] < -5010001000ll || x[u] > 5010001000ll)
        while (1) {
          int p;
          p++;
        }
    } else {
      int tmp1;
      long long tmp2, tmp3;
      std::cout << root->count(u, v, tmp1, tmp2, tmp3) << std::endl;
    }
  }
  return 0;
}
