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;
struct Node {
  long long lz, s, z;
  Node(long long a = 0, long long b = 0, long long c = 0) {
    lz = a, s = b, z = c;
  }
};
Node Merge(Node A, Node B) { return Node(0, A.s + B.s, A.z + B.z); }
const int N = 1e5 + 1;
const int Sz = N << 1;
Node nd[Sz << 2];
int sz = 0, fen[Sz];
void update(int id, int x) {
  nd[id].lz += x;
  nd[id].z += 1LL * x * nd[id].s;
}
void shift(int id) {
  update(id << 1, nd[id].lz);
  update(id << 1 | 1, nd[id].lz);
  nd[id].lz = 0;
}
void add(int L, int R, int x, int id = 1, int l = 0, int r = sz - 1) {
  if (R < l || r < L) return;
  if (L <= l && r <= R) {
    update(id, x);
    return;
  }
  shift(id);
  int mid = l + r >> 1;
  add(L, R, x, id << 1, l, mid);
  add(L, R, x, id << 1 | 1, mid + 1, r);
  nd[id] = Merge(nd[id << 1], nd[id << 1 | 1]);
}
void modify(int ind, int x, int z, int id = 1, int l = 0, int r = sz - 1) {
  if (l == ind && ind == r) {
    nd[id] = Node(z, x, 1LL * x * z);
    if (z <= -N - N) nd[id] = Node(0, 0, 0);
    return;
  }
  shift(id);
  int mid = l + r >> 1;
  if (ind <= mid)
    modify(ind, x, z, id << 1, l, mid);
  else
    modify(ind, x, z, id << 1 | 1, mid + 1, r);
  nd[id] = Merge(nd[id << 1], nd[id << 1 | 1]);
}
Node get(int L, int R, int id = 1, int l = 0, int r = sz - 1) {
  if (R < l || r < L) return Node(0, 0, 0);
  if (L <= l && r <= R) return nd[id];
  shift(id);
  int mid = l + r >> 1;
  return Merge(get(L, R, id << 1, l, mid), get(L, R, id << 1 | 1, mid + 1, r));
}
void add(int i, int sign) {
  for (i++; i < Sz; i += i & -i) fen[i] += sign;
}
int get(int i) {
  int ans = 0;
  for (i++; i > 0; i -= i & -i) ans += fen[i];
  return ans;
}
void print(int id = 1, int l = 0, int r = sz - 1) {
  cout << id << ' ' << l << ' ' << r << ' ' << nd[id].lz << ' ' << nd[id].s
       << ' ' << nd[id].z << endl;
  if (l == r) return;
  int mid = l + r >> 1;
  print(id << 1, l, mid);
  print(id << 1 | 1, mid + 1, r);
}
long long x[N], cp[N], tp[N], A[N], B[N];
vector<int> cor;
set<int> s;
map<long long, int> p;
void addPoint(int ind, int x, int sign) {
  int z = 2 * get(ind - 1) + 1 - N;
  modify(ind, x, sign == 1 ? z : -N - N - 10);
  add(ind + 1, sz - 1, 2 * sign);
  add(ind, sign);
  if (sign == 1)
    s.insert(ind);
  else
    s.erase(ind);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i];
    cp[i] = x[i];
    cor.push_back(x[i]);
  }
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    cin >> tp[i] >> A[i] >> B[i];
    if (tp[i] == 1) {
      --A[i];
      x[A[i]] += B[i];
      cor.push_back(x[A[i]]);
    }
  }
  sort(cor.begin(), cor.end());
  cor.erase(unique(cor.begin(), cor.end()), cor.end());
  sz = cor.size();
  for (int i = 0; i < sz; i++) p[cor[i]] = i;
  for (int i = 0; i < n; i++) x[i] = cp[i];
  for (int i = 0; i < n; i++) addPoint(p[x[i]], x[i], 1);
  for (int i = 0; i < m; i++) {
    if (tp[i] == 1) {
      addPoint(p[x[A[i]]], x[A[i]], -1);
      x[A[i]] += B[i];
      addPoint(p[x[A[i]]], x[A[i]], 1);
    }
    if (tp[i] == 2) {
      int l = lower_bound(cor.begin(), cor.end(), A[i]) - cor.begin();
      int r = upper_bound(cor.begin(), cor.end(), B[i]) - cor.begin() - 1;
      if (l > r)
        cout << 0 << endl;
      else {
        l = *s.lower_bound(l);
        r = *(--s.upper_bound(r));
        int cnt = get(r) - get(l - 1);
        int z = 2 * get(l - 1) + 1 - N;
        Node node = get(l, r);
        long long sumS = node.s, sumZ = node.z;
        sumZ += 1LL * (-cnt + 1 - z) * sumS;
        cout << sumZ << endl;
      }
    }
  }
}
