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 segtree {
  int l, r, num, posl, posr;
  long long sum, ans;
  segtree *left, *right;
} * root, zero;
int n, m, s[100005];
segtree *makenewpoint(void) {
  segtree *tem = new segtree;
  tem->l = tem->r = tem->sum = tem->num = tem->ans = 0;
  tem->posl = 1000000000 + 1;
  tem->posr = -1000000000 - 1;
  tem->left = tem->right = NULL;
  return tem;
}
void Segtree_Update(segtree *nowp) {
  nowp->num = nowp->left->num + nowp->right->num;
  nowp->sum = nowp->left->sum + nowp->right->sum;
  nowp->ans = nowp->left->num * nowp->right->sum -
              nowp->right->num * nowp->left->sum + nowp->left->ans +
              nowp->right->ans;
  nowp->posl = min(nowp->left->posl, nowp->right->posl);
  nowp->posr = max(nowp->left->posr, nowp->right->posr);
  return;
}
void Segtree_Makesons(segtree *nowp) {
  int mid = nowp->l + (nowp->r - nowp->l) / 2;
  if (nowp->left == NULL) {
    nowp->left = makenewpoint();
    nowp->left->l = nowp->l;
    nowp->left->r = mid;
  }
  if (nowp->right == NULL) {
    nowp->right = makenewpoint();
    nowp->right->l = mid + 1;
    nowp->right->r = nowp->r;
  }
  return;
}
void Segtree_Insert(segtree *nowp, int val) {
  int mid = nowp->l + (nowp->r - nowp->l) / 2;
  if (nowp->l == nowp->r) {
    nowp->num = 1;
    nowp->sum = nowp->posl = nowp->posr = val;
    return;
  }
  Segtree_Makesons(nowp);
  if (val <= mid)
    Segtree_Insert(nowp->left, val);
  else
    Segtree_Insert(nowp->right, val);
  Segtree_Update(nowp);
  return;
}
void Segtree_Delete(segtree *nowp, int val) {
  int mid = nowp->l + (nowp->r - nowp->l) / 2;
  if (nowp->l == nowp->r) {
    nowp->num = nowp->sum = nowp->ans = 0;
    nowp->posl = 1000000000 + 1;
    nowp->posr = -1000000000 - 1;
    return;
  }
  Segtree_Makesons(nowp);
  if (val <= mid)
    Segtree_Delete(nowp->left, val);
  else
    Segtree_Delete(nowp->right, val);
  Segtree_Update(nowp);
  return;
}
segtree updatespe(segtree teml, segtree temr) {
  segtree tem;
  tem.num = teml.num + temr.num;
  tem.sum = teml.sum + temr.sum;
  tem.ans = teml.num * temr.sum - temr.num * teml.sum + teml.ans + temr.ans;
  return tem;
}
segtree Segtree_Query(segtree *nowp, int needl, int needr) {
  int mid = nowp->l + (nowp->r - nowp->l) / 2;
  segtree teml, temr;
  teml = temr = zero;
  if (needl <= nowp->posl && nowp->posr <= needr) return *nowp;
  if (nowp->num == 0)
    return zero;
  else {
    if (mid >= needr)
      teml = Segtree_Query(nowp->left, needl, needr);
    else if (mid + 1 <= needl)
      temr = Segtree_Query(nowp->right, needl, needr);
    else
      teml = Segtree_Query(nowp->left, needl, mid),
      temr = Segtree_Query(nowp->right, mid + 1, needr);
    return updatespe(teml, temr);
  }
}
int main() {
  int i, a, b, c;
  scanf("%d", &n);
  root = makenewpoint();
  root->l = -1000000000;
  root->r = 1000000000;
  zero.num = zero.sum = zero.ans = 0;
  for (i = 1; i <= n; i++) scanf("%d", &s[i]), Segtree_Insert(root, s[i]);
  scanf("%d", &m);
  while (m--) {
    scanf("%d%d%d", &a, &b, &c);
    if (a == 1) {
      Segtree_Delete(root, s[b]);
      s[b] += c;
      Segtree_Insert(root, s[b]);
    } else
      printf("%I64d\n", Segtree_Query(root, b, c).ans);
  }
  return 0;
}
