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;
class nod {
 public:
  long long int sum, s1, s2, x, size, o;
  nod *sol, *sag;
  nod() {}
  nod(long long int t) {
    sum = s1 = s2 = x = t;
    o = rand() * rand();
    sol = sag = NULL;
    size = 1;
  }
};
typedef nod *NOD;
long long int SIZE(NOD tree) { return tree == NULL ? 0 : tree->size; }
long long int SUM(NOD tree) { return tree == NULL ? 0 : tree->sum; }
long long int S1(NOD tree) { return tree == NULL ? 0 : tree->s1; }
long long int S2(NOD tree) { return tree == NULL ? 0 : tree->s2; }
void update(NOD &tree) {
  if (tree == NULL) return;
  tree->size = SIZE(tree->sol) + SIZE(tree->sag) + 1;
  tree->sum = SUM(tree->sol) + SUM(tree->sag) + tree->x;
  tree->s1 = S1(tree->sol) + (tree->x) * (SIZE(tree->sol) + 1) + S1(tree->sag) +
             SUM(tree->sag) * (SIZE(tree->sol) + 1);
  tree->s2 = S2(tree->sol) + (SIZE(tree->sag) + 1) * SUM(tree->sol) +
             (tree->x) * (SIZE(tree->sag) + 1) + S2(tree->sag);
}
void merge(NOD &tree, NOD L, NOD R) {
  update(L);
  update(R);
  if (L == NULL) return void(tree = R);
  if (R == NULL) return void(tree = L);
  if (L->o > R->o) {
    merge(L->sag, L->sag, R);
    tree = L;
  } else {
    merge(R->sol, L, R->sol);
    tree = R;
  }
  update(tree);
}
void split(NOD tree, NOD &L, NOD &R, int k) {
  if (tree == NULL) return void(L = R = NULL);
  update(tree);
  int s = SIZE(tree->sol) + 1;
  if (k < s)
    split(tree->sol, L, tree->sol, k), R = tree;
  else
    split(tree->sag, tree->sag, R, k - s), L = tree;
  update(tree);
}
long long int lower_bound(NOD tree, long long int x) {
  if (tree == NULL) return 1;
  if (tree->x == x) return SIZE(tree->sol) + 1;
  if (tree->x > x) return lower_bound(tree->sol, x);
  if (tree->x < x) return lower_bound(tree->sag, x) + SIZE(tree->sol) + 1;
}
long long int upper_bound(NOD tree, long long int x) {
  if (tree == NULL) return 1;
  if (tree->x == x) return SIZE(tree->sol) + 2;
  if (tree->x > x) return upper_bound(tree->sol, x);
  if (tree->x < x) return upper_bound(tree->sag, x) + SIZE(tree->sol) + 1;
}
NOD tree;
long long int n, m, a[200000], b[200000];
void travel(NOD tree) {
  if (!tree) return;
  travel(tree->sol);
  cout << tree->x << " ";
  travel(tree->sag);
}
int main() {
  srand(10);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(b + 1, b + n + 1);
  for (int i = 1; i <= n; i++) merge(tree, tree, new nod(b[i]));
  long long int t, x, y, i, j;
  NOD t1, t2, t3, t4;
  cin >> m;
  while (m--) {
    cin >> t >> x >> y;
    if (t == 1) {
      i = lower_bound(tree, a[x]);
      split(tree, t1, t2, i - 1);
      split(t2, t3, t4, 1);
      merge(tree, t1, t4);
      a[x] += y;
      i = lower_bound(tree, a[x]);
      split(tree, t1, t2, i - 1);
      merge(t1, t1, new nod(a[x]));
      merge(tree, t1, t2);
    } else {
      i = lower_bound(tree, x);
      j = upper_bound(tree, y) - 1;
      if (i > j) {
        cout << 0 << endl;
        continue;
      }
      split(tree, t1, t2, i - 1);
      split(t2, t3, t4, j - i + 1);
      cout << t3->s1 - t3->s2 << endl;
      merge(t2, t3, t4);
      merge(tree, t1, t2);
    }
  }
}
