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

using namespace std;

const int N = 1e3 + 10;

//void build(vector<vector<int>> b)
//{
//	for (auto v : b)
//	{
//		for (int x : v) cout << x << ' ';
//		cout << endl;
//	}
//}

namespace dsu
{
	int n, fa[N];
	
	void init(int n)
	{
		dsu::n = n;
		for (int i = 0; i < n; i++) fa[i] = i;	
	}	
	
	int find(int x)
	{
		return fa[x] == x ? x : fa[x] = find(fa[x]);
	}
	
	void unite(int x, int y)
	{
		x = find(x), y = find(y);
		if (x == y) return;
		fa[x] = y;
	}
}

int n;
bool vis[N];
int p[N][N];
bool ans[N][N];

bool solve(vector<int> all)
{
	dsu::init(n);
	for (int x : all)
		for (int y : all)
			if (p[x][y] == 1) dsu::unite(x, y);
			else if (p[x][y] == 0) return false;
	for (int x : all)
		for (int y : all)
			if (p[x][y] == 2 && dsu::find(x) == dsu::find(y)) return false;
	vector<int> cyc;
	for (int x : all)
		if (dsu::find(x) != x) ans[x][dsu::find(x)] = ans[dsu::find(x)][x] = 1;
		else cyc.push_back(x);
	if (cyc.size() == 2) return false;
	for (int i = 0; i + 1 < cyc.size(); i++) ans[cyc[i]][cyc[i + 1]] = ans[cyc[i + 1]][cyc[i]] = 1;
	if (cyc.size() > 1) ans[cyc[0]][cyc.back()] = ans[cyc.back()][cyc[0]] = 1;
	return true;
}

int construct(vector<vector<int>> p)
{
	n = p.size();
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
		{
			::p[i][j] = p[i][j];
			if (p[i][j] == 3) return 0;
		}
	for (int i = 0; i < n; i++)
	{
		if (vis[i]) continue;
		
		queue<int> q;
		vector<int> cc;
		q.push(i); vis[i] = true;
		while (!q.empty())
		{
			int k = q.front(); q.pop();
			cc.push_back(k);
			for (int j = 0; j < n; j++)
				if (!vis[j] && p[k][j]) q.push(j), vis[j] = true;
		}
		bool res = solve(cc);
		if (!res) return 0;
	}
	vector<vector<int>> sol(n);
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			sol[i].push_back(ans[i][j]);
	build(sol);
	return 1;
}

//signed main()
//{
//	int n; cin >> n;
//	vector<vector<int>> p(n);
//	for (int i = 0; i < n; i++)
//		for (int j = 0, v; j < n; j++)
//			cin >> v, p[i].push_back(v);
//	construct(p);
//}