#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define FOR(i,l,r) for(int i = (l), _r = (r); i <= _r; i++)
#define FORNG(i,r,l) for(int i = (r), _l = (l); i >= _l; i--)
#define REP(i,r) for(int i = 0, _r = (r); i < _r; i++)
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define size(v) ((ll)(v).size())
#define all(v) (v).begin(),(v).end()
#define MASK(x) (1LL << (x))
#define BIT(x,i) (((x) >> (i)) & 1)
const ll N = 1e5 + 10, LOG = 18;
const ll INF = 1e18 + 36;
int construct(vector<vector<int>> p) {
int n = size(p);
vector<vector<int>> ans(n, vector<int>(n, 0));
REP(i,n - 1){
ans[i][i + 1] = 1;
ans[i + 1][i] = 1;
}
build(ans);
return 1;
}
