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 MAXN = 4e5 + 10;
long long n, bu, q;
long long pos[MAXN];
long long loc[MAXN];
long long last[MAXN];
vector<long long> point;
pair<pair<long long, long long>, pair<long long, long long> > query[MAXN];
pair<long long, pair<long long, long long> > seg[MAXN << 2];
bool Mark[MAXN];
bool MARK[MAXN];
void update(long long ind, long long s = 0, long long e = n, long long id = 1) {
  if (e - s == 1) {
    if (Mark[s])
      seg[id] = {0, {0, 0}};
    else
      seg[id] = {0, {point[s], 1}};
    Mark[s] ^= 1;
    return;
  }
  long long mid = e + s >> 1;
  if (ind < mid)
    update(ind, s, mid, id << 1);
  else
    update(ind, mid, e, id << 1 | 1);
  seg[id].first = seg[id << 1].first + seg[id << 1 | 1].first;
  seg[id].first += seg[id << 1].second.second * seg[id << 1 | 1].second.first;
  seg[id].first -= seg[id << 1].second.first * seg[id << 1 | 1].second.second;
  seg[id].second.first =
      seg[id << 1].second.first + seg[id << 1 | 1].second.first;
  seg[id].second.second =
      seg[id << 1].second.second + seg[id << 1 | 1].second.second;
}
pair<long long, pair<long long, long long> > get(long long l, long long r,
                                                 long long s = 0,
                                                 long long e = n,
                                                 long long id = 1) {
  if (r <= s || e <= l) return {0, {0, 0}};
  if (l <= s && e <= r) {
    return seg[id];
  }
  long long mid = e + s >> 1;
  pair<long long, pair<long long, long long> > res1, res2, res3;
  res2 = get(l, r, s, mid, id << 1);
  res3 = get(l, r, mid, e, id << 1 | 1);
  res1.first = res2.first + res3.first;
  res1.first += res2.second.second * res3.second.first;
  res1.first -= res2.second.first * res3.second.second;
  res1.second.first = res2.second.first + res3.second.first;
  res1.second.second = res2.second.second + res3.second.second;
  return res1;
}
long long find(long long tmp) {
  long long s = -1, e = n - 1;
  while (e - s > 1) {
    long long mid = e + s >> 1;
    if (point[mid] < tmp || (point[mid] == tmp && MARK[mid]))
      s = mid;
    else
      e = mid;
  }
  return e;
}
long long search(long long tmp) {
  long long s = -1, e = n - 1;
  if (point[e] < tmp) return n;
  while (e - s > 1) {
    long long mid = e + s >> 1;
    if (point[mid] < tmp)
      s = mid;
    else
      e = mid;
  }
  return e;
}
int main() {
  scanf("%lld", &n);
  bu = n;
  for (long long i = 0; i < n; i++) {
    scanf("%lld", &pos[i]);
    last[i] = pos[i];
    point.push_back(pos[i]);
  }
  scanf("%lld", &q);
  for (long long i = 0; i < q; i++) {
    long long type, l, r;
    scanf("%lld%lld%lld", &type, &l, &r);
    if (type == 1) {
      l--;
      r += last[l];
      last[l] = r;
    } else
      r++;
    query[i] = {{type, 0}, {l, r}};
    if (type == 1) point.push_back(r);
  }
  point.push_back(1e9 + 7);
  sort(point.begin(), point.end());
  n = point.size();
  for (long long i = 0; i < q; i++)
    if (query[i].first.first == 1) {
      query[i].first.second = find(query[i].second.second);
      MARK[query[i].first.second] = 1;
    }
  for (long long i = 0; i < bu; i++) {
    loc[i] = find(pos[i]);
    MARK[loc[i]] = 1;
    update(loc[i]);
  }
  for (long long i = 0; i < q; i++) {
    if (query[i].first.first == 1) {
      update(loc[query[i].second.first]);
      pos[query[i].second.first] = query[i].second.second;
      loc[query[i].second.first] = query[i].first.second;
      update(loc[query[i].second.first]);
    } else
      printf(
          "%lld\n",
          get(lower_bound(point.begin(), point.end(), query[i].second.first) -
                  point.begin(),
              lower_bound(point.begin(), point.end(), query[i].second.second) -
                  point.begin())
              .first);
  }
  return 0;
}
