#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };
#include "supertrees.h"
int parent[1000];
int find(int a)
{
if (parent[a] < 0)return a;
return parent[a] = find(parent[a]);
}
void merge(int a, int b)
{
a = find(a), b = find(b);
if (a != b)
{
parent[b] = a;
}
}
Vi v[1000];
bool chk[1000];
int construct(vector<Vi> p){
MEM_1(parent);
int n=p.size();
vector<Vi> b(n,Vi(n));
/*int mx=1;
fup(i,0,n-1,1){
fup(j,i+1,n-1,1){
mx=max(mx,p[i][j]);
}
}
if(mx==3){
fup(i,0,n-1,1){
fup(j,i+1,n-1,1)if(p[i][j]==2)return 0;
}
}*/
fup(i,0,n-1,1){
fup(j,i+1,n-1,1){
if(p[i][j]==3)return 0;
if(p[i][j]==1){
chk[i]=chk[j]=1;
merge(i,j);
}
}
}
fup(i,0,n-1,1){
fup(j,i+1,n-1,1){
if(p[i][j]==2 && find(i)==find(j))return 0;
if(p[i][j]==1){
if(i!=find(i))b[i][find(i)]=b[find(i)][i]=1;
if(j!=find(j))b[j][find(j)]=b[find(j)][j]=1;
}
}
}
fup(i,0,n-1,1){
fup(j,i+1,n-1,1){
if(p[i][j]==2){
int ii=find(i),jj=find(j);
if(chk[ii]){
v[ii].pb(jj);
parent[jj]=ii;
}else{
v[jj].pb(ii);
parent[ii]=jj;
}
}
}
}
fup(i,0,n-1,1){
fup(j,i+1,n-1,1){
if(p[i][j]==0 && find(i)==find(j))return 0;
}
}
fup(i,0,n-1,1){
if(i!=find(i)){
int j=find(i);
while(!v[i].empty()){
v[j].pb(v[i].back());
v[i].pop_back();
}
}
}
fup(i,0,n-1,1){
int N=v[i].size();
if(N==1 || N==2)return 0;
if(N>2){
fup(j,0,N-1,1){
if(j==0)b[i][v[i][j]]=b[v[i][j]][i]=1;
else b[v[i][j]][v[i][j-1]]=b[v[i][j-1]][v[i][j]]=1;
if(j==N-1)b[i][v[i][j]]=b[v[i][j]][i]=1;
}
}
}
build(b);
return 1;
}/*
int main() {
}*/
