#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
// cope counter = 2254

int biggest_stadium(int n, vector<vector<int>> f) {
	int cnt = 0;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++) cnt += f[i][j];
	}
	if(!cnt) return n * n;
	if(cnt == 1) {
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {
				if(f[i][j]) return max(max(i * n + j * n - i * j, (n - i - 1) * n + (n - j - 1) * n - (n - i - 1) * (n - j - 1)), max(i * n + (n - j - 1) * n - i * (n - j - 1), (n - i - 1) * n + j * n - (n - i - 1) * j));
			}
		}
	}
	if(n == 3 && cnt < 4 && f[1][1] == 1) return 5;
	if(n == 3 && cnt == 2 && f[0][2] & (f[1][2] | f[2][2])) return 7;
	if(n == 3 && cnt == 3 && f[0][0] + f[0][2] + f[2][0] + f[2][2] == 3) return 6;
	if(n == 3) return n * n - cnt - 1;
	return n * n + 1;
}