#include<bits/stdc++.h>
using namespace std;
#ifdef DEB
#define D if(1)
#else
#define D if(0)
#endif

#define fo(a,b) for(int a=0;a<(b);++a)
using ll = long long;

struct Inter
{
	int * a;
	int start;

	void init(int n)
	{
		for(start=1;start<=n;start*=2);
		a = new int[start * 2];
		for(int i=0;i<start*2;i++) a[i]=0;
	}

	void update(int i, int val)
	{
		i+=start;
		a[i]=val;
		for(i/=2;i;i/=2) a[i]=a[2*i]+a[2*i+1];
	}

	int sum(int i, int j)
	{
		i+=start;
		j+=start;
		int r=0;
		for(;i<j;i/=2,j/=2)
		{
			if(i%2!=0) r+=a[i++];
			if(j%2) r+=a[--j];
		}
		return r;
	}

	int sum2(int b, int e, int B, int E, int i)
	{
		if(e<=B || b>=E) return 0;
		if(b<=B && E<=e) return a[i];
		int M = (B+E)/2;
		return
			sum2(b,e,B,M,2*i)
			+
			sum2(b,e,B,M,2*i+1);
	}
};
Inter inter;

int main(int argc, char ** argv)
{
		int n;
	scanf("%d",&n);
	inter.init(n);
	while(1)
	{
		int i, j;
		char c;
		scanf(" %c%d%d",&c,&i,&j);
		if(c=='g') printf("%d\n",inter.sum(i,j));
		if(c=='g') printf("%d\n",inter.sum2(i,j,0,inter.start,1));
		else inter.update(i,j);
	}

	return 0;
}