#include <bits/stdc++.h>
#define MAXN 100000

using namespace std;
long long n, t[4 * MAXN];

void build (long long a[], long long v, long long tl, long long tr)
{
    if (tl == tr)
        t[v] = a[tl];
    else
    {
        long long tm = (tl + tr) / 2;
        build (a, v * 2, tl, tm);
        build (a, v * 2 + 1, tm + 1, tr);
        t[v] = t[v * 2] + t[v * 2 + 1];
    }
}

long long sum (long long v, long long tl, long long tr, long long l, long long r)
{
    if (l > r)
        return 0;

    if (l == tl && r == tr)
        return t[v];

    long long tm = (tl + tr) / 2;
    return sum (v * 2, tl, tm, l, min(r, tm)) + sum (v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
}

void update (long long v, long long tl, long long tr, long long pos, long long new_val)
{
    if (tl == tr)
        t[v] = new_val;
    else
    {
        long long tm = (tl + tr) / 2;
        if (pos <= tm)
            update (v * 2, tl, tm, pos, new_val);
        else
            update (v * 2 + 1, tm + 1, tr, pos, new_val);
        t[v] = t[v * 2] + t[v * 2 + 1];
    }
}

int main()
{
    long long n;
    scanf("%lld", &n);
    long long a[n + 1];
    for (int i = 1; i <= n; ++i)
        scanf("%lld", &a[i]);
    build(a, 1, 1, n);

    long long m;
    scanf("%lld", &m);

    for (int i = 0; i < m; ++i)
    {
        char c;
        scanf("\n%c", &c);

        if (c == 's')
        {
            long long l, r;
            scanf("%lld %lld", &l, &r);
            cout << sum (1, 1, n, l, r) << ' ';
        }
        else
        {
            long long l, r;
            scanf("%lld %lld", &l, &r);
            update(1, 1, n, l, r);
        }
    }

    return 0;
}