#include<cstdio>
#include<cstring>
#define LL long long
using namespace std;
int n,m,i;
LL tree[400010],ai;
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("shulie.in","r",stdin);
	freopen("shulie.out","w",stdout);
	scanf("%d", &n);
	for(i=1;i<=n;i++)
		scanf("%d", &ai),ADD(i,ai);
	scanf("%d", &m);
	while(m--)
	{
		char str[10];
		scanf("%s",str);
		if(!strcmp(str,"ADD"))
		{
			int a,b;
			scanf("%d%d",&a,&b);
			ADD(a,b);
		}
		else
		{
			int a,b;
			scanf("%d%d",&a,&b);
			printf("%d\n",SUM(b)-SUM(a-1));
		}
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}
int h=lyh();
int main(){;}