#include "supertrees.h"
// Skyqwq
#include <bits/stdc++.h>


#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 1005;

struct DSU{
	int n, f[N];
	void inline init(int l) {
		n = l;
		for (int i = 0; i < n; i++) f[i] = i;
	}
	int find(int x) {
		return x == f[x] ? x : f[x] = find(f[x]);
	}
	void merge(int x, int y) {
		f[find(x)] = find(y);
	}
} t1, t2;

namespace {
	int n, g[N][N];
	vector<int> A[N], B[N];
	vector<vector<int> > ans;
}

void inline add(int x, int y) {
	ans[x][y] = ans[y][x] = 1;
}

int construct(vector<vector<int> > p) {
	n = p.size();	
	int mx = 0;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			g[i][j] = p[i][j], chkMax(mx, g[i][j]);
	if (mx <= 2) {
		t1.init(n), t2.init(n);
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if (g[i][j] == 1) t1.merge(i, j);
			}
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				if (g[i][j] == 2)
					t2.merge(t1.find(i), t1.find(j));
			}
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				int w = 0;
				int x = t1.find(i), y = t1.find(j);
				int u = t2.find(x), v = t2.find(y);
				if (u != v) w = 0;
				else if (x == y) w = 1;
				else w = 2;
				//cout << i << " " << j << " " << w << " " << g[i][j] << endl;
				if (w != g[i][j]) {
					return 0;
				}
			}
		}
		
		for (int i = 0; i < n; i++) {
			int x = t1.find(i);
			A[x].pb(i);
			if (x == i)
				B[t2.find(x)].pb(x);
			vector<int> t(n, 0);
			ans.pb(t);
		} 
		for (int i = 0; i < n; i++) {
			if (t1.find(i) == i) {
				for (int j = 0; j + 1 < A[i].size(); j++)
					add(A[i][j], A[i][j + 1]);
			}
			if (B[i].size() == 2) return 0;
			if (t2.find(i) == i && B[i].size() > 1) {
				for (int j = 0; j + 1 < B[i].size(); j++)
					add(A[B[i][j]][0], A[B[i][j + 1]][0]);
				add(A[B[i].back()][0], A[B[i][0]][0]);
			}
		}
		build(ans);
	} else {
		return 0;
	}
	return 1;
}