#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> ans;
vector<int> adj[1005],adj2[1005];
int pa[1005],pa2[1005];
bool vis[1005];
int fp(int u){
if(pa[u]==u)return u;
return pa[u]=fp(pa[u]);
}
void dfs(int u){
for(auto v:adj2[u]){
if(vis[pa2[v]])continue;
vis[pa2[v]]=1;
pa[fp(u)]=fp(v);
ans[u][v]=ans[v][u]=1;
dfs(v);
}
}
int construct(vector<vector<int>> p) {
int n = p.size();
for (int i = 0; i < n; i++) {
vector<int> row;
row.resize(n);
ans.push_back(row);
}
iota(pa,pa+n,0);
for(int i=0;i<n;++i)for(int j=0;j<n;++j)if(p[i][j]==3)return 0;
for(int i=0;i<n;++i)for(int j=0;j<n;++j)if(p[i][j]==1)pa[fp(i)]=fp(j);
for(int i=0;i<n;++i)adj[fp(i)].emplace_back(i);
for(int i=0;i<n;++i)for(auto j:adj[i])ans[i][j]=ans[j][i]=1;
for(int i=0;i<n;++i)pa2[i]=pa[i];
iota(pa,pa+n,0);
for(int i=0;i<n;++i)for(int j=0;j<n;++j)if(p[i][j]==2){
adj2[i].emplace_back(j);
adj2[j].emplace_back(i);
}
for(int i=0;i<n;++i)dfs(i);
for(int i=0;i<n;++i)fp(i);
for(int i=0;i<n;++i)for(int j=0;j<n;++j){
if(i==j)continue;
if(ans[i][j]==1&&p[i][j]==0)return 0;
if(pa[i]==pa[j]&&pa2[i]==pa2[j])return 0;
}
build(ans);
return 1;
}
