#include <bits/stdc++.h>
using namespace std;

using ll = long long;

    struct node {
        ll val, prior, cnt, freq, sum, lz;
        node *l, *r;
        node() {
            val = prior = cnt = freq = sum = lz = 0;
            l = r = nullptr;
        }
        node(int _val, int _freq) {
            val = _val;
            prior = rand();
            cnt = _freq;
            freq = _freq;
            sum = _val;
            lz = 0;
            l = r = nullptr;
        }
    };
    typedef struct node* pnode;
    pnode root;
    int cnt(pnode t) {
        return t ? t->cnt : 0;
    }
    ll sum(pnode t) {
        return t ? t->sum : 0;
    }
    void push(pnode t) {
        if (!t || t->lz == 0) return;
        t->val += t->lz;
        t->sum += t->cnt * t->lz;
        if (t->l) t->l->lz += t->lz;
        if (t->r) t->r->lz += t->lz;
        t->lz = 0;
    }
    void upd(pnode t) {
        if (t) {
            t->cnt = cnt(t->l) + cnt(t->r) + t->freq;
            t->sum = sum(t->l) + sum(t->r) + t->freq * t->val;
        }
    }
    void split(pnode t, pnode &l, pnode &r, int key) {
        push(t);
        if (!t) {
            l = r = nullptr;
        }
        else if (t->val <= key) {
            split(t->r, t->r, r, key), l = t;
        }
        else {
            split(t->l, l, t->l, key), r = t;
        }
        upd(t);
    }
    void merge(pnode &t, pnode l, pnode r) {
        push(t);
        if (!l || !r) {
            t = l ? l : r;
        }
        else if (l->prior > r->prior) {
            merge(l->r, l->r, r), t = l;
        }
        else {
            merge(r->l, l, r->l), t = r;
        }
        upd(t);
    }
    void output(pnode t) {
        if (!t) return;
        push(t);
        output(t->l);
        cout << "(" << t->val << ", " << t->freq << "), ";
        output(t->r);
    }

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        ll x;
        cin >> x;
        pnode l, m, r;
        split(root, m, r, x);
        split(m, l, m, x - 1);
        if (!m) m = new node(x, 1);
        else m->freq++;
        merge(root, l, m);
        merge(root, root, r);
    }
    //output(root); cout << "\n";
    int q;
    cin >> q;
    while (q--) {
        string op;
        cin >> op;
        if (op == "SET") {
            ll x, y;
            cin >> x >> y;
            pnode l, m, r;
            split(root, m, r, x);
            split(m, l, m, x - 1);
            if (!m) {
                merge(root, l, r);
                //output(root); cout << "\n";
                push(root);
                cout << root->sum << "\n";
                continue;
            }
            ll Toadd = m->freq;
            merge(root, l, r);
            split(root, m, r, y);
            split(m, l, m, y - 1);
            if (!m) m = new node(y, Toadd);
            else m->freq += Toadd;
            merge(root, l, m);
            merge(root, root, r);
        }
        else {
            ll x;
            cin >> x;
            root->lz += x;
        }
        //output(root); cout << "\n";
        push(root);
        cout << root->sum << "\n";
    }
}