#include<cstdio>
#include<cstring>
#define LL long long
using namespace std;

int n,m,i;
LL tree[400010],ai[100010];
inline int L(int a) 
{
	return a&(-a);
}
inline void ADD(int x,int w)
{
	for(int k=x;k<=n;k+=L(k))tree[k]+=w;
}
inline LL SUM(int x)
{
	int k=x;
	LL s;
	while(k>0)
	{
		s+=tree[k];
		k-=L(k);
	}
	return s;
}
int lyh()
{
	freopen("shulieb.in","r",stdin);
	freopen("shulieb.out","w",stdout);
	scanf("%d", &n);
	for(i=1;i<=n;i++)
		scanf("%d", &ai[i]);
	scanf("%d", &m);
	while(m--)
	{
		char str[10];
		scanf("%s",str);
		if(!strcmp(str,"ADD"))
		{
			int a,b,c;
			scanf("%d%d%d",&a,&b,&c);
			ADD(a,c);
			ADD(b+1,-c);
		}
		else
		{
			int a;
			scanf("%d",&a);
			printf("%d\n",SUM(a)+ai[a]);
		}
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}
int h=lyh();
int main(){;}