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 = LLONG_MAX / 10;
const long long MOD = 1e9;
template <typename T>
struct SegmentTree {
  using F = function<T(T, T)>;
  int n;
  F f;
  T ti;
  vector<T> dat;
  SegmentTree(){};
  SegmentTree(F f, T ti) : f(f), ti(ti) {}
  void init(int n_) {
    n = 1;
    while (n < n_) n <<= 1;
    dat.assign(n << 1, ti);
  }
  void build(const vector<T> &v) {
    int n_ = v.size();
    init(n_);
    for (int i = 0; i < n_; i++) dat[n + i] = v[i];
    for (int i = n - 1; i; i--)
      dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
  }
  void set_val(int k, T x) {
    dat[k += n] = x;
    while (k >>= 1) dat[k] = f(dat[(k << 1) | 0], dat[(k << 1) | 1]);
  }
  T query(int a, int b, int k = 1, int l = 0, int r = -1) {
    if (r < 0) r = n;
    if (r <= a || b <= l) return ti;
    if (a <= l && r <= b) return dat[k];
    T vl = query(a, b, k * 2, l, (l + r) / 2);
    T vr = query(a, b, k * 2 + 1, (l + r) / 2, r);
    return f(vl, vr);
  }
  T operator[](const int &k) const { return dat[k + n]; }
};
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long N;
  cin >> N;
  vector<long long> x(N);
  vector<long long> v;
  for (long long i = 0; i < N; i++) {
    cin >> x[i];
    v.push_back(x[i]);
  }
  vector<long long> xcopy(x);
  long long M;
  cin >> M;
  vector<tuple<long long, long long, long long> > query(M);
  for (long long q = 0; q < M; q++) {
    long long t, a, b;
    cin >> t >> a >> b;
    query[q] = make_tuple(t, a, b);
    if (t & 1) {
      a--;
      xcopy[a] += b;
      v.push_back(xcopy[a]);
    } else {
      v.push_back(a);
      v.push_back(b + 1);
    }
  }
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  map<long long, long long> mp;
  for (long long i = 0; i < (long long)v.size(); i++) {
    mp[v[i]] = i;
  }
  using hoge = tuple<long long, long long, long long>;
  auto f = [](hoge a, hoge b) {
    long long aans, acnt, asum;
    tie(aans, acnt, asum) = a;
    long long bans, bcnt, bsum;
    tie(bans, bcnt, bsum) = b;
    long long cans, ccnt, csum;
    cans = aans + bans + bsum * acnt - asum * bcnt;
    ccnt = acnt + bcnt;
    csum = asum + bsum;
    return make_tuple(cans, ccnt, csum);
  };
  SegmentTree<hoge> seg(f, make_tuple(0, 0, 0));
  seg.init(v.size());
  for (long long i = 0; i < N; i++) {
    long long idx = mp[x[i]];
    seg.set_val(idx, make_tuple(0, 1, x[i]));
  }
  for (long long q = 0; q < M; q++) {
    long long t, a, b;
    tie(t, a, b) = query[q];
    if (t & 1) {
      a--;
      long long idx = mp[x[a]];
      seg.set_val(idx, make_tuple(0, 0, 0));
      x[a] += b;
      idx = mp[x[a]];
      seg.set_val(idx, make_tuple(0, 1, x[a]));
    } else {
      long long l = mp[a];
      long long r = mp[b + 1];
      long long ans, cnt, sum;
      tie(ans, cnt, sum) = seg.query(l, r);
      cout << ans << endl;
    }
  }
  return 0;
}
