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>
#pragma comment(linker, "/STACK:10000000")
using namespace std;
template <class T>
T inline sqr(T x) {
  return x * x;
}
const double pi = 3.1415926535897932384626433832795, eps = 1e-8;
const int maxn = 100500, inf = (int)1e9;
struct node {
  int x, y;
  long long size;
  long long sum;
  long long val;
  node *l, *r;
  node(int x) : x(x), y(rand()), size(1), sum(x), val(0), l(0), r(0) {}
};
typedef node* pnode;
long long size(pnode t) {
  if (t)
    return t->size;
  else
    return 0;
}
long long val(pnode t) {
  if (t)
    return t->val;
  else
    return 0;
}
long long sum(pnode t) {
  if (t)
    return t->sum;
  else
    return 0;
}
void upd(pnode t) {
  if (t) {
    t->size = size(t->l) + size(t->r) + 1;
    t->sum = sum(t->l) + sum(t->r) + t->x;
    t->val = val(t->l) + val(t->r) + sum(t->r) * size(t->l) -
             sum(t->l) * size(t->r) + (t->x * size(t->l) - sum(t->l)) +
             (sum(t->r) - t->x * size(t->r));
  }
}
void split(pnode t, int x, pnode& l, pnode& r) {
  if (!t)
    l = r = NULL;
  else if (x < t->x)
    split(t->l, x, l, t->l), r = t;
  else
    split(t->r, x, t->r, r), l = t;
  upd(t);
}
void merge(pnode& t, pnode l, pnode r) {
  if (!r)
    t = l;
  else if (!l)
    t = r;
  else if (l->y < r->y)
    merge(l->r, l->r, r), t = l;
  else
    merge(r->l, l, r->l), t = r;
  upd(t);
}
int main() {
  int n;
  pnode root = NULL;
  scanf("%d", &n);
  vector<int> a(n);
  vector<int> b(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  sort(b.begin(), b.end());
  for (int i = 0; i < n; i++) {
    pnode x = new node(b[i]);
    merge(root, root, x);
  }
  int m;
  scanf("%d", &m);
  for (int i = 0; i < m; i++) {
    int t, x, y;
    scanf("%d%d%d", &t, &x, &y);
    if (t == 1) {
      x--;
      int z = a[x];
      a[x] += y;
      pnode left, middle, right;
      split(root, z, left, right);
      split(left, z - 1, left, middle);
      assert(size(middle) == 1);
      pnode p = new node(z + y);
      if (y > 0) {
        split(right, z + y, middle, right);
        merge(middle, middle, p);
      } else {
        split(left, z + y, left, middle);
        merge(middle, p, middle);
      }
      merge(left, left, middle);
      merge(root, left, right);
    } else {
      pnode left, right, middle;
      split(root, x - 1, left, right);
      split(right, y, middle, right);
      cout << val(middle) << "\n";
      merge(left, left, middle);
      merge(root, left, right);
    }
  }
  return 0;
}
