// 树状数组
#include <iostream>
#include <cstdio>
#include <fstream>
#define lowbit(x) (x & -x)
using namespace std;

const int MAXN = 1e5 + 10;

int n, m;
int a[MAXN], c[MAXN];

void add(int x, int y) {
	for (; x <= n; x += lowbit(x)) c[x] += y;
}

int sum(int x) {
	int res = 0;
	for (; x; x -= lowbit(x)) res += c[x];
	return res;
}

int main() {
	freopen("shulie.in", "r", stdin);
	freopen("shulie.out", "w", stdout);
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
		for (int j = i - lowbit(i) + 1; j <= i; ++j) {
			c[i] += a[j];
		}
	}
	scanf("%d", &m);
	while (m--) {
		char op[10]; int x, y;
		scanf("%s %d %d", op, &x, &y);
		if (op[0] == 'A') {
			add(x, y);
		} else {
			printf("%d\n", sum(y) - sum(x - 1));
		}
	}
	return 0;
}