#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cmath>
#define lowbit(x) x&(-x)
using namespace std;
int a, b, k, tmp, n, m;
int c[400001];
char ch[6];
void ADD(int p, int x) {
	while(p <= n) {
		c[p] += x;
		p += lowbit(p);
	}
}
void add(int p, int x) {
	while(p <= n) {
		c[p] -= x;
		p += lowbit(p);
	}
}
int ask(int p) {
	int t = 0;
	while(p > 0) {
		t += c[p];
		p -= lowbit(p);
	}
	return t;
}
int main() {
	freopen("shulieb.in", "r", stdin);
	freopen("shulieb.out", "w", stdout);
	scanf("%d", &n);
	tmp = 0;
	for(int i = 1; i <= n; i++) {
		scanf("%d", &a);
		ADD(i, a-tmp);
		tmp = a;
	}
	scanf("%d", &m);
	for(int i = 1; i <= m; i++) {
		scanf("%s", ch);
		if(ch[0]=='Q') {
			scanf("%d", &a);
			printf("%d\n", ask(a));
			continue;
		}
		scanf("%d%d%d", &a, &b, &k);
		ADD(a, k);
		add(b+1, k);
	}
	return 0;
}