#include "supertrees.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define rmin(r, x) r = min(r, x)
#define rmax(r, x) r = max(r, x)
#define ends ' '
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0), cin.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 1e3 + 10;
int n;
vector<vector<int>> b;
int construct(vector<std::vector<int>> p) {
n = p.size();
b.resize(n);
for(int i = 0; i < n; ++i) b[i].resize(n);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(i-j==1 || j-i==1)
{
p[i][j]=1;
}
}
}
build(b);
return 1;
}
