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 long long INF = 1LL << 40;
const int N = 200020;
struct Node {
  Node *ch[2], *p;
  int sz;
  long long key, sum, mu;
  void init() {
    sz = 1;
    p = ch[0] = ch[1] = NULL;
  }
  bool d() { return p->ch[1] == this; }
  void setc(int d, Node *x) {
    ch[d] = x;
    if (x) x->p = this;
  }
  void upd() {
    int k = ch[0] ? ch[0]->sz : 0;
    sz = 1;
    sum = key;
    mu = k * key;
    if (ch[0]) sz += ch[0]->sz, sum += ch[0]->sum, mu += ch[0]->mu;
    if (ch[1])
      sz += ch[1]->sz, sum += ch[1]->sum,
          mu += ch[1]->mu + (k + 1) * ch[1]->sum;
  }
  void relax() {}
} mem[N], *cur = mem, *root;
Node *maken(long long key) {
  cur->init();
  cur->key = key;
  cur->sum = key;
  cur->mu = 0;
  return cur++;
}
void rot(Node *x) {
  Node *y = x->p, *z = y->p;
  y->relax();
  x->relax();
  int d = x->d();
  if (z) z->setc(y->d(), x);
  y->setc(d, x->ch[!d]);
  x->setc(!d, y);
  y->upd();
  if (!z) root = x, x->p = NULL;
}
void splay(Node *x, Node *f = NULL) {
  while (x->p != f) rot(x);
  x->upd();
}
Node *next(Node *x) {
  if (!x->ch[1]) {
    while (x->d()) x = x->p;
    return x->p;
  }
  x = x->ch[1];
  while (x->ch[0]) x = x->ch[0];
  return x;
}
Node *prev(Node *x) {
  if (!x->ch[0]) {
    while (!x->d()) x = x->p;
    return x->p;
  }
  x = x->ch[0];
  while (x->ch[1]) x = x->ch[1];
  return x;
}
void insert(Node *x) {
  Node *rt = root;
  int d;
  while (rt->ch[d = x->key > rt->key]) rt = rt->ch[d];
  rt->setc(d, x);
  splay(x);
}
void erase(Node *x) {
  Node *l = prev(x), *r = next(x);
  splay(l), splay(r, l);
  r->ch[0] = NULL;
  r->upd();
  l->upd();
}
Node *find(long long key) {
  Node *x = root;
  while (1) {
    if (x->key == key || !x->ch[key > x->key]) return x;
    x = x->ch[key > x->key];
  }
}
Node *rank(int k) {
  Node *x = root;
  while (true) {
    int tmp = x->ch[0] ? x->ch[0]->sz : 0;
    if (k == tmp) break;
    if (k < tmp)
      x = x->ch[0];
    else
      x = x->ch[1], k -= tmp + 1;
  }
  splay(x);
  return x;
}
void display(Node *x = root) {
  if (x->ch[0]) display(x->ch[0]);
  cout << x->key << endl;
  if (x->ch[1]) display(x->ch[1]);
}
int a[N], sa[N];
int n;
Node *build(int l, int r) {
  if (l > r) return NULL;
  int m = (l + r) >> 1;
  Node *x = maken(sa[m]);
  x->setc(0, build(l, m - 1));
  x->setc(1, build(m + 1, r));
  x->upd();
  return x;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    sa[i] = a[i];
  }
  sort(sa + 1, sa + 1 + n);
  root = build(1, n);
  insert(maken(INF));
  insert(maken(-INF));
  int m;
  cin >> m;
  while (m--) {
    long long c, l, r;
    cin >> c >> l >> r;
    if (c == 1) {
      Node *t = find(a[l]);
      erase(t);
      insert(maken(a[l] += r));
    } else {
      Node *x = find(l);
      Node *y = find(r);
      if (x->key >= l) x = prev(x);
      if (y->key <= r) y = next(y);
      splay(x);
      splay(y, x);
      Node *t = y->ch[0];
      if (!t)
        cout << 0 << endl;
      else
        cout << 2 * t->mu - (t->sz - 1) * t->sum << endl;
    }
  }
  return 0;
}
