#include <bits/stdc++.h>
#include "treasure.h"
using namespace std;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
map<pair<pii,pii>, int> Q;
int ask(int i0, int j0, int i1, int j1){
if(i0 > i1 || j0 > j1) return 0;
pair<pii, pii> rect = mp(mp(i0,j0), mp(i1,j1));
if(Q.count(rect)){
return Q[rect];
}
return Q[rect]=countTreasure(i0,j0,i1,j1);
}
int n;
const int N = 105;
int pref[N][N];
void findTreasure (int _n) {
n = _n;
for(int i = n; i >= 1; i -- ){
for(int j = n; j >= 1; j -- ){
if(i > n / 2 && j > n / 2){
pref[i][j] = ask(1, 1, i, j);
}
else if(j > n / 2 && i <= n / 2){
pref[i][j] = pref[n][j] - ask(i + 1, 1, n, j);
}
else if(i > n / 2 && j <= n / 2){
pref[i][j] = pref[i][n] - ask(1, j + 1, i, n);
}
else{
pref[i][j] = -(pref[n][n] - ask(i + 1, j + 1, n, n) - pref[i][n] - pref[n][j]);
}
}
}
for(int i = 1; i <= n; i ++ ){
for(int j = 1; j <= n; j ++ ){
if(pref[i][j] - pref[i - 1][j] - pref[i][j - 1] + pref[i - 1][j - 1] == 1){
Report(i, j);
}
}
}
}
