#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int sz[1001],par[1001];
int find(int a){
if(a==par[a]) return a;
int x=find(par[a]);
par[a]=x;
return x;
}
vector<int> v[1005];
bitset<1001> vis;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
for(int i=0;i<n;i++){
sz[i]=1;
par[i]=i;
for(int j=0;j<n;j++){
if(p[i][j]==3) return 0;
if(p[i][j]==2){
v[i].push_back(j);
v[j].push_back(i);
vis[i]=1;
vis[j]=1;
}
}
}
std::vector<std::vector<int>> answer(n,vector<int> (n,0));
if(n==1){
build({{0}});
return 1;
}
for(int i=0;i<n;i++){
if(vis[i]){
if(v[i].size()!=4){
cout << v[i].size() << "NO";
return 0;
}
}
}
for(int i=0;i<n;i++){
if(vis[i]){
int x=find(i);
int y=find(v[i][0]);
if(x!=y){
if(sz[x]<sz[y]) swap(x,y);
else if(sz[x]==sz[y] && x>y) swap(x,y);
sz[x]+=sz[y];
par[y]=x;
}
answer[i][v[i][0]]=1;
answer[v[i][0]][i]=1;
x=find(i);
y=find(v[i][1]);
if(x!=y){
if(sz[x]<sz[y]) swap(x,y);
else if(sz[x]==sz[y] && x>y) swap(x,y);
sz[x]+=sz[y];
par[y]=x;
}
answer[i][v[i][1]]=1;
answer[v[i][1]][i]=1;
}
}
for (int i = 0; i < n; i++) {
for(int j=0;j<n;j++){
int x=find(i);
int y=find(j);
if(p[i][j]==0 && x==y) return 0;
if(p[i][j]==1){
if(x==y) continue;
if(sz[x]<sz[y]) swap(x,y);
else if(sz[x]==sz[y] && x>y) swap(x,y);
sz[x]+=sz[y];
par[y]=x;
answer[x][y]=1;
answer[y][x]=1;
}
}
}
build(answer);
return 1;
}
