#include<bits/stdc++.h>
#include "supertrees.h"
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define sz(a) ((int) (a).size())
#define pb emplace_back
#define me(a, x) memset(a, x, sizeof(a))
#define vi vector<int>
#define ull unsigned long long
using namespace std;
const int N = 1 << 21, mod = 1e9 + 7;
int n;
int f[N];
int find(int x) {
	return f[x] == x ? x : f[x] = find(f[x]);
}
vector<vi>ans,p;
int sub_prob(vi a) {
	for(int i : a) for(int j : a) if(p[i][j] == 0)return 0;
	L(i, 0, n - 1) f[i] = i;
	for(int i : a) for(int j : a) if(p[i][j] == 1)f[find(i)] = find(j);
	for(int i : a) for(int j : a) if(p[i][j] != p[find(i)][find(j)]) return 0;
	vi good;
	for(int i: a) if(find(i) == i)good.pb(i);
	if(sz(good) == 2) return 0;
	for(int i: a) if(find(i) != i) ans[i][find(i)] = ans[find(i)][i] = 1;
	if(sz(good) >= 3) {
		L(i, 0, sz(good) - 1) {
			int u = good[i];
			int v = good[(i + 1) % sz(good)];
			ans[u][v] = ans[v][u] = 1;
		}
	}
	return 1;
}
int construct(vector<vi>pp) {
	p = pp;
	n = sz(p);
	ans.resize(n);
	L(i, 0, n - 1) ans[i].resize(n);
	L(i, 0, n - 1) L(j, 0, n - 1) if(p[i][j] > 2) return 0;
	L(i, 0, n - 1)f[i] = i;
	L(i, 0, n - 1) L(j, i + 1, n - 1) if(p[i][j]) f[find(i)] = find(j);
	vector<vi>qwq;
	L(i, 0, n - 1) if(find(i) == i) {
		vi a;
		L(j, 0, n - 1) if(find(j) == i)a.pb(j);
		qwq.pb(a);
	}
	for(auto a : qwq) if(!sub_prob(a))return 0;
	// L(i, 0, n - 1) {
	// 	L(j, 0, n - 1) {
	// 		cout<<ans[i][j];
	// 	}
	// 	cout<<'\n';
	// }
	build(ans);
	return 1;
}
// int main() {
// 	ios :: sync_with_stdio(false);
// 	cin.tie(0); cout.tie(0);
// 	vector<vi>tank;
// 	tank.pb(vi{1, 1, 2, 2});
// 	tank.pb(vi{1, 1, 2, 2});
// 	tank.pb(vi{2, 2, 1, 2});
// 	tank.pb(vi{2, 2, 2, 1});
// 	construct(tank);
// 	// cout << compare_plants(1, 2) << endl;
// 	return 0;
// }