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 N = 1e5 + 5;
const int MAX = 1e9 + 5;
int a[N], x, y, wh, n, m, point;
class node {
 public:
  long long ans, sum, size, point, heap;
  node *left, *right;
  node() {
    ans = sum = size = point = 0;
    left = right = NULL;
  }
};
typedef node *pnode;
pnode T, l, r, lr, lll, rubbish;
pnode make(int x) {
  pnode temp = new node;
  temp->ans = 0;
  temp->size = 1;
  temp->point = temp->sum = x;
  temp->heap = rand();
  return temp;
}
long long take_point(pnode T) {
  if (T) return T->point;
  return -1000000000;
}
long long take_size(pnode T) {
  if (T) return T->size;
  return 0;
}
long long take_sum(pnode T) {
  if (T) return T->sum;
  return 0;
}
long long take_ans(pnode T) {
  if (T) return T->ans;
  return 0;
}
void upd(pnode &T) {
  if (!T) return;
  T->size = take_size(T->left) + take_size(T->right) + 1;
  T->sum = take_sum(T->left) + take_sum(T->right) + T->point;
  T->ans = take_ans(T->left) + take_ans(T->right) +
           take_size(T->left) * take_sum(T->right) -
           take_size(T->right) * take_sum(T->left);
  T->ans += take_sum(T->right) - take_size(T->right) * T->point;
  T->ans += take_size(T->left) * T->point - take_sum(T->left);
}
void split(pnode T, pnode &l, pnode &r, int x) {
  if (!T) return (void)(l = r = NULL);
  upd(T);
  if (take_point(T) > x) {
    pnode temp;
    split(T->left, l, T->left, x);
    r = T;
  } else {
    pnode temp;
    split(T->right, T->right, r, x);
    l = T;
  }
  upd(l);
  upd(r);
}
void merge(pnode &T, pnode l, pnode r) {
  upd(l);
  upd(r);
  if (!l) return (void)(T = r);
  if (!r) return (void)(T = l);
  if (l->heap <= r->heap) {
    merge(l->right, l->right, r);
    T = l;
  } else {
    merge(r->left, l, r->left);
    T = r;
  }
  upd(T);
}
void add(int x) {
  pnode l, r;
  split(T, l, r, x - 1);
  merge(l, l, make(x));
  merge(T, l, r);
}
void print(pnode T) {
  if (!T) return;
  print(T->left);
  cout << T->point << ' ';
  print(T->right);
}
void del(int x) {
  pnode l, r, rubbish;
  split(T, l, r, x);
  split(l, l, rubbish, x - 1);
  merge(T, l, r);
}
long long calc(int x, int y) {
  long long ans = 0;
  split(T, l, r, y);
  split(l, lll, lr, x - 1);
  ans = take_ans(lr);
  merge(l, lll, lr);
  merge(T, l, r);
  return ans;
}
int main() {
  srand(time(0));
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &point);
    add(point);
    a[i] = point;
  }
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d", &wh);
    if (wh == 1) {
      scanf("%d %d", &x, &y);
      del(a[x]);
      a[x] += y;
      add(a[x]);
    } else {
      scanf("%d %d", &x, &y);
      printf("%lld\n", calc(x, y));
    }
  }
  return 0;
}
