#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
#include "supertrees.h"
struct DSU{
    int p[1005],sz[1005];
    void init(int n){
        iota(p,p+n,0);
        fill(sz,sz+n,1);
    }
    int Find(int u){
        return(p[u]==u?u:(p[u]=Find(p[u])));
    }
    bool operator()(int u,int v){
        u=Find(u);v=Find(v);
        if(u==v)return 0;
        if(sz[u]>sz[v])swap(u,v);
        sz[v]+=sz[u];
        p[u]=v;
        return 1;
    }
}dsu;
int construct(vector<vector<int>>p){
	int n=p.size();
	vector<vector<int>>E(n,vector<int>(n));
    dsu.init(n);
    bitset<1005>bit[n];
	for(int i=0;i<n;i++){
        bit[i].reset();
        for(int j=0;j<n;j++){
            bit[i][j]=(p[i][j]==1);
            if(p[i][j]==3)return 0;
            if(p[i][j])dsu(i,j);
        }
    }
    for(int i=0;i<n;i++){
        int cnt=0;
        for(int j=0;j<n;j++)cnt+=(p[i][j]>0);
        if(cnt!=dsu.sz[dsu.Find(i)]||p[i][i]!=1)return 0;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(p[i][j]==2&&(bit[i]&bit[j]).count())return 0;
        }
    }
    int vis[n]={};
    for(int i=0;i<n;i++){
        if(dsu.Find(i)==i){
            vector<int>nodes,cycle;
            for(int j=0;j<n;j++){
                if(dsu.Find(j)==i)nodes.push_back(j);
            }
            for(auto v:nodes){
                if(vis[v])continue;
                vector<int>chain;
                for(int u=0;u<n;u++){
                    if(p[v][u]==1){
                        chain.push_back(u),vis[u]=1;
                    }
                }
                sort(chain.begin(),chain.end());
                for(int j=1;j<chain.size();j++)E[chain[j-1]][chain[j]]=E[chain[j]][chain[j-1]]=1;
                cycle.push_back(chain.back());
            }
            if(cycle.size()==1)continue;
            if(cycle.size()==2)return 0;
            cycle.push_back(cycle[0]);
            for(int j=1;j<cycle.size();j++)E[cycle[j-1]][cycle[j]]=E[cycle[j]][cycle[j-1]]=1;
        }
    }
    build(E);
    return 1;
}