// Subtask 3
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
bool visited[N];
int construct(vector<vector<int>> p)
{
int n = p.size();
vector<vector<int>> ans(n, vector<int> (n, 0));
vector<int> connectedList[n];
for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (i == j || p[i][j] == 2) connectedList[i].push_back(j);
for (int i=0 ; i<n ; i++) if (connectedList[i].size() > 0 && connectedList[i].size() < 2) return 0;
for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (p[i][j] == 2 && connectedList[i] != connectedList[j]) return 0;
for (int i=0 ; i<n ; i++) if (!visited[i])
{
visited[i] = true;
int u = -1, v = -1;
for (int j=i+1 ; j<n ; j++) if (p[i][j] == 2)
{
ans[i][j] = ans[j][i] = 1;
if (u == -1) u = j;
else if (v == -1) v = j;
}
ans[u][v] = ans[v][u] = 1;
}
build(ans);
return 1;
}
