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>
int rd() {
  int k = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') k = k * 10 + c - '0', c = getchar();
  return k * f;
}
const int N = 200001;
int pn, n, m, o, x, y, z, b, c, rt, rnd[N], v[N], sz[N], ch[N][2], a[N];
long long s[N], w[N];
void Up(int t) {
  sz[t] = sz[ch[t][0]] + sz[ch[t][1]] + 1,
  s[t] = s[ch[t][0]] + s[ch[t][1]] + v[t];
  w[t] = w[ch[t][0]] + w[ch[t][1]] + sz[ch[t][0]] * s[ch[t][1]] -
         sz[ch[t][1]] * s[ch[t][0]] + s[ch[t][1]] -
         (long long)sz[ch[t][1]] * v[t] + (long long)sz[ch[t][0]] * v[t] -
         s[ch[t][0]];
}
void Split(int t, int& a, int& b, int w) {
  if (!t) {
    a = b = 0;
    return;
  }
  if (w >= v[t])
    a = t, Split(ch[t][1], ch[t][1], b, w);
  else
    b = t, Split(ch[t][0], a, ch[t][0], w);
  Up(t);
}
int Merge(int a, int b) {
  if (!a || !b) return a | b;
  if (rnd[a] < rnd[b]) {
    ch[a][1] = Merge(ch[a][1], b), Up(a);
    return a;
  }
  ch[b][0] = Merge(a, ch[b][0]), Up(b);
  return b;
}
int main() {
  pn = n = rd();
  for (int i = 1; i <= n; ++i)
    Split(rt, x, y, s[i] = v[i] = a[i] = rd()), rnd[i] = rand(), sz[i] = 1,
                                                rt = Merge(Merge(x, i), y);
  m = rd();
  while (m--) {
    o = rd(), b = rd(), c = rd();
    if (o == 1) {
      Split(rt, x, y, a[b] - 1), Split(y, y, z, a[b]),
          rt = Merge(Merge(x, Merge(ch[y][0], ch[y][1])), z);
      rnd[++pn] = rand(), v[pn] = s[pn] = c + a[b], sz[pn] = 1,
      Split(rt, x, y, a[b] = v[pn]), rt = Merge(Merge(x, pn), y);
    } else
      Split(rt, x, y, b - 1), Split(y, y, z, c), printf("%lld\n", w[y]),
          rt = Merge(Merge(x, y), z);
  }
  return 0;
}
