#include "soccer.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PLL;
typedef vector <int> vi;
typedef vector <vi> vvi;
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i = a;i < b;i++)
#define trav(nx, v) for(auto &nx : v)
#define all(a) begin(a), end(a)
#define sz(v) (int) v.size()

int n;
bool check(const vvi &stadium){
	// cek kolom
	rep(iter,0,2){
		for(int i = 0;i < n;i++){
			// cek min sama max 2 setiap baris
			int meet = 0;
			for(int j = 0;j < n;j++){
				int x = i;
				int y = j;
				if(!iter) swap(x, y);
				if(!meet){
					if(stadium[x][y] == 2) meet++;
					else continue;
				} else if(meet == 1){
					if(stadium[x][y] == 2) continue;
					else meet++;
				} else{
					if(stadium[x][y] == 2) return 0;
					else continue;
				}
			}
		}
	}
	return 1;
}

int biggest_stadium(int N, std::vector<std::vector<int>> F){
	vvi tmp = F;
	n = N;
	int ans = 0;
	rep(mask,0,(1<<(N * N))){
		rep(i,0,N) rep(j,0,N) if(tmp[i][j] == 2) tmp[i][j] = 0;
		bool can = 1;
		rep(i,0,N * N) if((mask>>i)&1 && tmp[i/N][i%N] == 1) can = 0;
		if(!can) continue;
		rep(i,0,N * N) if((mask>>i)&1 && tmp[i/N][i%N] == 0){
			tmp[i/N][i%N] = 2;
		}
		can = check(tmp);
		if(!can) continue;
		auto curans = __builtin_popcount(mask);
		if(curans > ans){
			ans = curans;
			//~ rep(i,0,N) {
				//~ rep(j,0,N) cout << tmp[i][j];
				//~ cout << endl;
			//~ }
		
		}
	}
    return ans	;
}