#include<bits/stdc++.h>
#include"supertrees.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e3 + 5;

int fa[MAXN];
int find(int u){ return fa[u] == u? u: fa[u] = find(fa[u]);}

int construct(vector< vector<int> > p)
{
	int n = (int)p.size();
	
	iota(fa, fa+n, 0);
	for(int i=0; i<n; ++i)
		for(int j=0; j<i; ++j)
		{
			if(p[i][j] == 3)
				return 0;
			if(p[i][j])
				fa[find(i)] = find(j);
		}
	
	for(int i=0; i<n; ++i)
		for(int j=0; j<i; ++j)
			if(p[i][j] == 0 && find(i) == find(j))
				return 0;
	
	iota(fa, fa+n, 0);
	for(int i=0; i<n; ++i)
		for(int j=0; j<i; ++j)
			if(p[i][j] == 1)
				fa[find(i)] = find(j);
	
	for(int i=0; i<n; ++i)
		for(int j=0; j<i; ++j)
			if(p[i][j] != 1 && find(i) == find(j))
				return 0;
	
	vector< vector<int> > res(n, vector<int>(n));
	
	for(int i=0; i<n; ++i)
		if(find(i) != i)
			res[i][find(i)] = res[find(i)][i] = 1;
	
	vector<int> vis(n);
	for(int i=0; i<n; ++i) if(fa[i] == i && !vis[i])
	{
		vector<int> vec;
		vis[i] = 1; vec.emplace_back(i);
		for(int j=0; j<n; ++j) if(fa[j] == j && p[i][j] == 2)
			vis[j] = 1, vec.emplace_back(j);
		
		if(vec.size() == 1) continue;
		if(vec.size() == 2) return 0;
		
		for(int j=0; j<(int)vec.size(); ++j)
		{
			int u = vec[j], v = vec[(j+1)%(int)vec.size()];
			res[u][v] = res[v][u] = 1;
		}
	}
	
	build(res);
	return 1;
}