#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
vector<int> vec[N];
int construct(vector<vector<int>> p){
int n = p.size();
vector<vector<int>> b(n, vector<int>(n, 0));
vector<int> vis(n, 0);
int cnt = 0;
for (int i = 0; i < n; i++){
if (vis[i]){
for (int j = 0; j < n; j++){
if (p[i][j] != vec[vis[i]][j]) return 0;
}
continue;
}
vis[i] = ++cnt;
for (int j = 0; j < n; j++){
if (p[i][j] and i != j) vis[j] = cnt;
vec[cnt].pb(p[i][j]);
}
}
vector<int> chk(n+1, 0);
for (int i = 0; i < n; i++){
if (chk[vis[i]]++) continue;
for (int j = 0; j < n; j++){
if (p[i][j] and i != j) b[i][j] = b[j][i] = 1;
}
}
// for (int i = 0; i < n; i++){
// for (int j = 0; j < n; j++) cout << b[i][j] << ' ';
// cout << '\n';
// }
build(b);
return 1;
}
// int main ()
// {
// int n;
// cin >> n;
// vector<vector<int>> p(n, vector<int>(n));
// for (int i = 0; i < n; i++){
// for (int j = 0; j < n; j++) cin >> p[i][j];
// }
// int x = construct(p);
// }
