#include <iostream>
using namespace std;
 
//our 2d Fenwick tree
int F[1047][1047];
 
//add to element on position (x,y) value val
void update(int x, int y, int v) {
	for(int i=x; i<1042; i+=i&-i)
		for(int j=y; j<1042; j+=j&-j)
			F[i][j]+=v;
}
 
//get sum of rectangle (0,0,x,y)
int get(int x, int y) {
	int res=0;
	for(int i=x; i>0; i-=i&-i)
		for(int j=y; j>0; j-=j&-j)
			res+=F[i][j];
	return res;
}
 
//get sum of rectangle (x1,y1,x2,y2)
int getRect(int x1, int y1, int x2, int y2) {
	return get(x2,y2)-get(x2,y1-1)-get(x1-1,y2)+get(x1-1,y1-1);
}
 
int main() {
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKLy9vdXIgMmQgRmVud2ljayB0cmVlCmludCBGWzEwNDddWzEwNDddOwoKLy9hZGQgdG8gZWxlbWVudCBvbiBwb3NpdGlvbiAoeCx5KSB2YWx1ZSB2YWwKdm9pZCB1cGRhdGUoaW50IHgsIGludCB5LCBpbnQgdikgewoJZm9yKGludCBpPXg7IGk8MTA0MjsgaSs9aSYtaSkKCQlmb3IoaW50IGo9eTsgajwxMDQyOyBqKz1qJi1qKQoJCQlGW2ldW2pdKz12Owp9CgovL2dldCBzdW0gb2YgcmVjdGFuZ2xlICgwLDAseCx5KQppbnQgZ2V0KGludCB4LCBpbnQgeSkgewoJaW50IHJlcz0wOwoJZm9yKGludCBpPXg7IGk+MDsgaS09aSYtaSkKCQlmb3IoaW50IGo9eTsgaj4wOyBqLT1qJi1qKQoJCQlyZXMrPUZbaV1bal07CglyZXR1cm4gcmVzOwp9CgovL2dldCBzdW0gb2YgcmVjdGFuZ2xlICh4MSx5MSx4Mix5MikKaW50IGdldFJlY3QoaW50IHgxLCBpbnQgeTEsIGludCB4MiwgaW50IHkyKSB7CglyZXR1cm4gZ2V0KHgyLHkyKS1nZXQoeDIseTEtMSktZ2V0KHgxLTEseTIpK2dldCh4MS0xLHkxLTEpOwp9CgppbnQgbWFpbigpIHsKCXJldHVybiAwOwp9