#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <stdio.h>
#include <assert.h>
#include <string.h>
using namespace __gnu_pbds;
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <random>
#include <string>
#include <cstring>
#include "treasure.h"
#include <set>
#include <map>
#include <time.h>
using namespace std;
typedef tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
bool a[105][105];
bool check(int x1, int y1, int x2, int y2, int startx, int starty, int endx, int endy, int now, int x) {
return false;
}
void rec(int x1, int y1, int x2, int y2, int now) {
if(now == (x2 - x1 + 1) * (y2 - y1 + 1)) {
for(int i = x1; i <= x2; ++i)
for(int j = y1; j <= y2; ++j)
a[i][j] = 1;
return;
}
int sum = 0, midx = x1 + x2 >> 1, midy = y1 + y2 >> 1;
int x = countTreasure(x1, y1, midx, midy);
sum += x;
if(x)
rec(x1, y1, midx, midy, x);
if(check(x1, x2, y1, y2, x1, y1, midx, midy, now - sum, x) || sum == now)
return;
x = countTreasure(midx + 1, y1, x2, midy);
sum += x;
if(x)
rec(midx + 1, y1, x2, midy, x);
if(check(x1, y1, x2, y2, midx + 1, y1, x2, midy, now - sum, x) || sum == now)
return;
x = countTreasure(midx + 1, midy + 1, x2, y2);
sum += x;
if(x)
rec(midx + 1, midy + 1, x2, y2, x);
if(check(x1, x2, y1, y2, midx + 1, midy + 1, x2, y2, now - sum, x) || sum == now)
return;
x = countTreasure(x1, midy + 1, midx, y2);
sum += x;
if(x)
rec(x1, midy + 1, midx, y2, x);
}
void findTreasure (int N) {
int x1 = 1, y1 = 1, x2 = N, y2 = N, x = countTreasure(1, 1, N, N);
rec(1, 1, N, N, x);
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= N; ++j)
if(a[i][j])
Report(i, j);
}
