#include<bits/stdc++.h>
#include "treasure.h"
using namespace std;
const int nmax=100+42;
int n;
bool output[nmax][nmax];
int pref[nmax][nmax];
/*
int countTreasure(int x1,int y1,int x2,int y2)
{
cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
int ret;
cin>>ret;
return ret;
}
void Report(int i,int j)
{
cout<<"treasure: "<<i<<" "<<j<<endl;
}
*/
map< pair< pair<int,int>, pair<int,int> > ,int> seen;
int ask(int x1,int y1,int x2,int y2)
{
if(x1>x2||y1>y2)return 0;
pair< pair<int,int>, pair<int,int> > state={{x1,y1},{x2,y2}};
if(seen.count(state)==0)seen[state]=countTreasure(x1,y1,x2,y2);
return seen[state];
}
int exact(int i,int j)
{
if(i<=n/2&&j<=n/2)return ask(i,j,n,n)-ask(i+1,j,n,n)-ask(i,j+1,n,n)+ask(i+1,j+1,n,n);
if(i<=n/2&&j>n/2)return ask(i,1,n,j)-ask(i,1,n,j-1)-ask(i+1,1,n,j)+ask(i+1,1,n,j-1);
if(i>n/2&&j>n/2)return ask(1,1,i,j)-ask(1,1,i-1,j)-ask(1,1,i,j-1)+ask(1,1,i-1,j-1);
return ask(1,j,i,n)-ask(1,j+1,i,n)-ask(1,j,i-1,n)+ask(1,j+1,i-1,n);
}
void findTreasure(int N)
{
n=N;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
output[i][j]=exact(i,j);
}
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(output[i][j])Report(i,j);
}
/*
int main()
{
findTreasure(2);
}
*/
