#include <cstdio>
#include <string>
#define Max 100010
using namespace std;
int n=0,m=0,A[Max],d=0;
struct node
{
	int lazy;
}tree[4*Max];
void add(int rt,int l,int r,int a,int b)
{
	if(a<=l && r<=b)
	{
		tree[rt].lazy+=d;
		return;
	}
	if(b<l || a>r)
		return;
	int mid=(l+r)>>1;
	add(rt<<1,l,mid,a,b);
	add(rt<<1|1,mid+1,r,a,b);
}
int query(int rt,int l,int r,int a,int b)
{
	if(l==r)
		return A[l]+tree[rt].lazy;
	int mid=(l+r)>>1;
	if(a<=mid)
		return query(rt<<1,l,mid,a,b)+tree[rt].lazy;
	else
		return query(rt<<1|1,mid+1,r,a,b)+tree[rt].lazy;
}
int main()
{
	freopen("shulieb.in","r",stdin);
	freopen("shulieb.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",A+i);
	scanf("%d",&m);
	while(m--)
	{
		string s;
		int i=0,j=0;
		s.resize(5);
		scanf("%s",&s[0]);
		if(s=="QUERY")
		{
			scanf("%d",&i);
			printf("%d\n",query(1,1,n,i,i));
		}
		else
		{
			scanf("%d%d%d",&i,&j,&d);
			add(1,1,n,i,j);
		}
	}
	return 0;
}