#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> ans;
vector<int> adj[1005];
set<int> adj2[1005];
int pa[1005],pa2[1005];
int gr[1005];
bool vis[1005];
bool flag=0;
int fp(int u){
if(pa[u]==u)return u;
return pa[u]=fp(pa[u]);
}
void dfs(int u,int r){
vis[u]=1;
if(gr[u]==-1)gr[u]=r;
else if(gr[u]!=r)flag=1,cout << u << ' ' << gr[u] << "!=" << r << "\n---\n";
for(auto v:adj2[u]){
if(ans[u][v]==1)continue;
if(v==r)ans[u][v]=ans[v][u]=1;
if(fp(v)==fp(r))continue;
pa[fp(u)]=fp(v);
ans[u][v]=ans[v][u]=1;
dfs(v,r);
}
}
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);
}
for(int i=0;i<n;++i)gr[i]=-1;
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])if(i!=j)ans[i][j]=ans[j][i]=1;
for(int i=0;i<n;++i)pa2[i]=pa[i];
for(int i=0;i<n;++i)for(int j=0;j<n;++j)if(p[i][j]==2){
adj2[pa2[i]].insert(pa2[j]);
adj2[pa2[j]].insert(pa2[i]);
}
for(int i=0;i<n;++i)if(i==pa2[i])if(!vis[i])dfs(i,i);
if(flag)return 0;
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(pa[i]==pa[j]&&p[i][j]==0)return 0;
if(pa2[i]==pa2[j]&&p[i][j]!=1)return 0;
if(pa[i]==pa[j]&&pa2[i]!=pa2[j]&&p[i][j]!=2)return 0;
if(pa[i]!=pa[j]&&p[i][j]!=0)return 0;
}
build(ans);
return 1;
}
