#include <bits/stdc++.h>
#include "supertrees.h"
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int construct(vector<vector<int> > p) {
int n = p.size();
vector<int> cnt(4);
for(int i=0; i<n; i++)
for(int j=0; j<n; j++) cnt[p[i][j]]++;
vector<vector<int> > b(n, vector<int>(n));
if(cnt[1] == n * n) {
for(int i=1; i<n; i++)
b[i-1][i] = 1, b[i][i-1] = 1;
build(b);
return 1;
}
return 0;
}
// int32_t main() {
// setIO();
// int n;
// cin >> n;
// vector<vector<int> > p(n, vector<int>(n));
// for(int i=0; i<n; i++)
// for(int j=0; j<n; j++) cin >> p[i][j];
// cout << construct(p) << '\n';
// return 0;
// }
