#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
#include <tuple>

using namespace std;

int t[5 * 100000];

void build(int v, int vl, int vr, int a[]) {
    if (vl == vr) {
        t[v] = a[vl];
        return;
    }
    int vm = vl + (vr - vl) / 2;
    build(2 * v + 1, vl, vm, a);
    build(2 * v + 2, vm + 1, vr, a);

    t[v] = t[2 * v + 1] + t[2 * v + 2];
}

long long query(int v, int vl, int vr, int l, int r) {
    if (r < vl || vr < l)
        return 0;
    if (l <= vl && vr <= r) return t[v];
    int vm = vl + (vr - vl) / 2;
    long long ql = query(2 * v + 1, vl, vm, l, r);
    long long qr = query(2 * v + 2, vm + 1, vr, l, r);

    return ql + qr;
}

void change(int v, int vl, int vr, int idx, int val) {
    if (vl == vr) {
        t[v] = val;
        return;
    }
    int vm = vl + (vr - vl) / 2;
    if (idx <= vm)
        change(2 * v + 1, vl, vm, idx, val);
    else
        change(2 * v + 2, vm + 1, vr, idx, val);

    t[v] = t[2 * v + 1] + t[2 * v + 2];
}

int main() {
    int n, m, a[100000];
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];

    build(0, 0, n - 1, a);
    cin >> m;

    for (int i = 0; i < n; i++) {
        char c;
        int l, r;
        cin >> c >> l >> r;

        if (c == 's') {
            cout << query(0, 0, n - 1, l - 1, r - 1) << " ";
        } else {
            change(0, 0, n - 1, l - 1, r);
        }
    }
    return 0;
}