#include "supertrees.h"
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 1e6 + 100, M = 4096 + 10, len = 21, inf = 1e18;
const ll mod = 1e9 + 7;
int construct(vector<vector<int>> p) {
int n = p.size();
vector<vector<int>> answer;
for (int i = 0; i < n; i++) {
vector<int> row;
row.resize(n);
if(i == 1){
for(int j = 1; j < n; j++){
row[j] = 1;
}
} else row[0] = 1;
answer.push_back(row);
}
build(answer);
return 1;
}
// int main() {
// ios::sync_with_stdio(false);
// cin.tie(NULL);
//
//
// return 0;
// }
