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 M = 2e5 + 5;
long long seg[3][4 * M], hlp[3][4 * M];
int a[M], f[M], lq[M], rq[M], b[M], arr[M], ptr;
void upd(int p, int t, int l = 0, int r = ptr, int id = 1) {
  if (r - l < 2) {
    seg[0][id] += t, seg[1][id] += arr[p] * t;
    return;
  }
  int mid = (l + r) / 2;
  if (p < mid)
    upd(p, t, l, mid, 2 * id);
  else
    upd(p, t, mid, r, 2 * id + 1);
  for (int i = 0; i < 3; i++) seg[i][id] = seg[i][2 * id] + seg[i][2 * id + 1];
  seg[2][id] +=
      seg[1][2 * id + 1] * seg[0][2 * id] - seg[1][2 * id] * seg[0][2 * id + 1];
}
void get(int ql, int qr, int l = 0, int r = ptr, int id = 1) {
  if (r <= ql || qr <= l) {
    for (int i = 0; i < 3; i++) hlp[i][id] = 0;
    return;
  }
  if (ql <= l && r <= qr) {
    for (int i = 0; i < 3; i++) hlp[i][id] = seg[i][id];
    return;
  }
  int mid = (l + r) / 2;
  get(ql, qr, l, mid, 2 * id), get(ql, qr, mid, r, 2 * id + 1);
  for (int i = 0; i < 3; i++) hlp[i][id] = hlp[i][2 * id] + hlp[i][2 * id + 1];
  hlp[2][id] +=
      hlp[1][2 * id + 1] * hlp[0][2 * id] - hlp[1][2 * id] * hlp[0][2 * id + 1];
}
int32_t main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++)
    scanf("%d", a + i), b[i] = a[i], arr[ptr++] = a[i];
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    scanf("%d%d%d", f + i, lq + i, rq + i);
    if (f[i] == 2) continue;
    int x = lq[i];
    rq[i] = b[x] + rq[i], lq[i] = b[x];
    b[x] = rq[i], arr[ptr++] = rq[i];
  }
  sort(arr, arr + ptr);
  ptr = unique(arr, arr + ptr) - arr;
  for (int i = 1; i <= n; i++) upd(lower_bound(arr, arr + ptr, a[i]) - arr, 1);
  for (int i = 0; i < m; i++) {
    lq[i] = lower_bound(arr, arr + ptr, lq[i]) - arr;
    if (f[i] == 1) {
      rq[i] = lower_bound(arr, arr + ptr, rq[i]) - arr;
      upd(lq[i], -1), upd(rq[i], 1);
    } else {
      rq[i] = upper_bound(arr, arr + ptr, rq[i]) - arr;
      get(lq[i], rq[i]);
      printf("%lld\n", hlp[2][1]);
    }
  }
  return 0;
}
