#include <bits/stdc++.h>
#include "treasure.h"
using namespace std;
void findTreasure(int N) {
int a[N+1][N+1] {};
for(int i = N + 1; --i; ) for(int j = N + 1; --j; ) {
int b[4] = {i * j, j * (N - i), i * (N - j), (N - i) * (N - j)}, k = max_element(b, b + 4) - b;
if(k == 0) a[i][j] = countTreasure(1, 1, i, j);
if(k == 1) a[i][j] = a[N][j] - countTreasure(i + 1, 1, N, j);
if(k == 2) a[i][j] = a[i][N] - countTreasure(1, j + 1, i, N);
if(k == 3) a[i][j] = countTreasure(i + 1, j + 1, N, N) + a[i][N] + a[N][j] - a[N][N];
}
for(int i = N + 1; --i; ) for(int j = N + 1; --j; )
if(a[i][j] - a[i-1][j] - a[i][j-1] + a[i-1][j-1]) Report(i, j);
}
