#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
const int N = 100;
int cmp[N] , cnt , ch[N] , papa[N] , vis[N];
vector<vector<int>> ans;
vector<int> Q , a;
int construct(vector<vector<int>> p){
int n = p.size();
for(int i= 0; i < n; ++i)for(int j =0; j < n; ++j) if(p[i][j] == 3 || p[i][j] != p[j][i]) return 0;
ans.resize(n);
for(int i = 0; i < n; ++i) ans[i].resize(n);
for(int i = 0; i < n; ++i){
if(cmp[i])continue;
cmp[i] = ++cnt;
for(int j =0; j < n; ++j) if(p[i][j])cmp[j] = cmp[i];
}
/// components
for(int i = 0; i < n; ++i) for(int j = 0; j <n; ++j) if((cmp[i] == cmp[j]) ^ (p[i][j] != 0)) return 0;
cnt = 0;
memset(papa , -1 , sizeof(papa));
for(int i = 0; i < n; ++i){
if(ch[i]) continue;
ch[i] = ++cnt; Q.emplace_back(i);
for(int j = 0; j < n; ++j) if(p[i][j] == 1) papa[j] = i , ch[j] = ch[i];
}
/// multiple cycles
for(int i= 0; i < n; ++i) for(int j = 0; j < n; ++j) if((ch[i] == ch[j]) ^ (p[i][j] == 1)) return 0;
for(int i = 0; i < n; ++i) if(papa[i] != i && papa[i] >= 0) ans[i][papa[i]] = ans[papa[i]][i] = 1;
//cout << Q.size() << " Q.size()" << endl;
for(int i : Q){
if(vis[i])continue;
a.resize(0);
for(int j : Q) if(cmp[i] == cmp[j]) vis[j] = 1 , a.push_back(j);
cout << a.size() << " a.size()" << endl;
if(a.size() == 2) return 0;
if(a.size() == 1) continue;
for(int k= 0; k < a.size(); ++k){
int X = a[k] , Y = a[(k + 1) % a.size()];
if(X ^ Y) ans[X][Y] = ans[Y][X] = 1;
}
}build(ans);
/*
for(int i = 0; i< n; ++i){
for(int j = 0; j < n; ++j)cout << ans[i][j]<< " ";cout << endl;
}
*/
}
/*
int main (){
construct({{1 , 1 ,2 , 2} , {1 , 1 ,2 ,2} , {2 ,2 ,1 ,2} , {2 , 2 ,2 ,1}});
}
*/
