1195

/*
一维树状数组的简单二维扩展 
*/

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef long long LL;
typedef unsigned long long ULL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define FORi(a,b,c) for(int i=(a);i<(b);i+=c)
#define FORj(a,b,c) for(int j=(a);j<(b);j+=c)
#define FORk(a,b,c) for(int k=(a);k<(b);k+=c)
#define FORp(a,b,c) for(int p=(a);p<(b);p+=c)
#define FORii(a,b,c) for(int ii=(a);ii<(b);ii+=c)
#define FORjj(a,b,c) for(int jj=(a);jj<(b);jj+=c)
#define FORkk(a,b,c) for(int kk=(a);kk<(b);kk+=c)

#define FF(i,a)    for(int i=0;i<(a);i++)
#define FFD(i,a)   for(int i=(a)-1;i>=0;i--)

#define Z(a) (a<<1)
#define Y(a) (a>>1)

const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
	return TMIN(TMIN(x,y),z);
}


// code begin
int Bit[1025][1025];
int cmd,S,X,Y,A,L,B,R,T;
int Nx,Ny;
inline int lowBit(int x)
{
	return x&(-x);
}

void update(int x,int y,int c)
{
	for(int i=x;i<Nx;i+=lowBit(i))
	{
		for(int j=y;j<Ny;j+=lowBit(j))
		{
			Bit[i][j] += c;
		}
	}
}

int getSum(int x,int y)
{
	int ans = 0;
	for(int i=x;i>0;i-=lowBit(i))
	{
		for(int j=y;j>0;j-=lowBit(j))
		{
			ans += Bit[i][j];
		}
	}
	return ans;
}

int main()
{
	read;
	write;
	scanf("%d",&cmd);
	while(cmd!=3)
	{
		switch(cmd)
		{
		case 0:
			scanf("%d",&S);
			Nx = Ny = S+1;
			memset(Bit,0,sizeof(Bit));
			break;
		case 1:
			//更新
			scanf("%d %d %d",&X,&Y,&A);
			update(X+1,Y+1,A);
			break;
		case 2:
			//查找
			scanf("%d %d %d %d",&L,&B,&R,&T);
			printf("%d\n",getSum(R+1,T+1)-getSum(L,T+1)-(getSum(R+1,B)-getSum(L,B)) );
			break;
		default:
			break;
		}
		scanf("%d",&cmd);
	}
	return 0;
}