#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long nmax = 100005;
long long n, a[nmax], m, b[nmax];
vector<long long> vecc;
vector<pair<long long, pair<long long, long long>>> Queries;
struct item {
  long long nr_el, val, sum;
  item() { nr_el = val = sum = 0; }
};
vector<item> tree(16 * nmax);
item _merge(item A, item B) {
  item ANS;
  ANS.nr_el = A.nr_el + B.nr_el;
  ANS.sum = A.sum + B.sum;
  ANS.val = A.val + B.val - A.sum * B.nr_el + B.sum * A.nr_el;
  return ANS;
}
void update(long long l, long long r, long long pos, long long val1,
            long long val2, long long nod) {
  if (l == r) {
    tree[nod].nr_el += val1;
    tree[nod].sum += val2;
  } else {
    long long mid = l + (r - l) / 2;
    if (pos <= mid) {
      update(l, mid, pos, val1, val2, 2 * nod);
    } else {
      update(mid + 1, r, pos, val1, val2, 2 * nod + 1);
    }
    tree[nod] = _merge(tree[2 * nod], tree[2 * nod + 1]);
  }
}
item query(long long l, long long r, long long le, long long ri,
           long long nod) {
  if (l > ri || r < le) {
    item lol;
    return lol;
  } else if (l >= le && r <= ri)
    return tree[nod];
  else {
    long long mid = l + (r - l) / 2;
    return _merge(query(l, mid, le, ri, 2 * nod),
                  query(mid + 1, r, le, ri, 2 * nod + 1));
  }
}
int32_t main() {
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    b[i] = a[i];
    vecc.push_back(a[i]);
  }
  cin >> m;
  for (long long i = 1; i <= m; i++) {
    long long type;
    cin >> type;
    if (type == 1) {
      long long x, y;
      cin >> x >> y;
      b[x] += y;
      vecc.push_back(b[x]);
      Queries.push_back({type, {x, y}});
    } else {
      long long x, y;
      cin >> x >> y;
      vecc.push_back(x);
      vecc.push_back(y);
      Queries.push_back({type, {x, y}});
    }
  }
  sort((vecc).begin(), (vecc).end());
  vecc.resize(unique((vecc).begin(), (vecc).end()) - vecc.begin());
  long long nn = (long long)vecc.size();
  for (long long i = 1; i <= n; i++) {
    long long pos =
        lower_bound((vecc).begin(), (vecc).end(), a[i]) - vecc.begin() + 1;
    update(1, nn, pos, 1, a[i], 1);
  }
  for (long long i = 1; i <= m; i++) {
    if (Queries[i - 1].first == 1) {
      long long pos = lower_bound((vecc).begin(), (vecc).end(),
                                  a[Queries[i - 1].second.first]) -
                      vecc.begin() + 1;
      update(1, nn, pos, -1, -a[Queries[i - 1].second.first], 1);
      a[Queries[i - 1].second.first] += Queries[i - 1].second.second;
      pos = lower_bound((vecc).begin(), (vecc).end(),
                        a[Queries[i - 1].second.first]) -
            vecc.begin() + 1;
      update(1, nn, pos, 1, a[Queries[i - 1].second.first], 1);
    } else {
      long long x = lower_bound((vecc).begin(), (vecc).end(),
                                Queries[i - 1].second.first) -
                    vecc.begin() + 1;
      long long y = lower_bound((vecc).begin(), (vecc).end(),
                                Queries[i - 1].second.second) -
                    vecc.begin() + 1;
      cout << query(1, nn, x, y, 1).val << '\n';
    }
  }
}
