#include <bits/stdc++.h>
using namespace std;
int n;
int A[1005];
int B[1005];
void add(int i,int val,int n){
A[i-1]+=val;
while(i<=n){
B[i] +=val;
i+=i&(-i);
}
}
void build_tree(int A[],int n){
for(int i=0;i<n;i++){
add(i+1,A[i],n);
}
}
int read(int k){
int sum=0;
while(k){
sum+=(B[k]);
k-=k&(-k);
}
return sum;
}
int main() {
//memset(dp,0x00000001,sizeof(int)*11*55)
cin>>n;
for(int i=0;i<n;i++){
cin>>A[i];
//cout<<A[i];
}
build_tree(A,n);
char o;int n1,n2;
while(scanf(" %c %d %d",&o,&n1,&n2)==3){
//cout<<o<<endl;
if(o=='a')add(n1+1,n2,n);
else cout<<read(n2+1)-read(n1+1)+A[n1]<<endl;
}
return 0;
}
using namespace std;
int n;
int A[1005];
int B[1005];
void add(int i,int val,int n){
A[i-1]+=val;
while(i<=n){
B[i] +=val;
i+=i&(-i);
}
}
void build_tree(int A[],int n){
for(int i=0;i<n;i++){
add(i+1,A[i],n);
}
}
int read(int k){
int sum=0;
while(k){
sum+=(B[k]);
k-=k&(-k);
}
return sum;
}
int main() {
//memset(dp,0x00000001,sizeof(int)*11*55)
cin>>n;
for(int i=0;i<n;i++){
cin>>A[i];
//cout<<A[i];
}
build_tree(A,n);
char o;int n1,n2;
while(scanf(" %c %d %d",&o,&n1,&n2)==3){
//cout<<o<<endl;
if(o=='a')add(n1+1,n2,n);
else cout<<read(n2+1)-read(n1+1)+A[n1]<<endl;
}
return 0;
}