#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "soccer.h"
int n;
VVI a;
VVI prefv;
VVI prefh;
bool canv(int ux, int uy, int vx, int vy) {
int y = uy;
int l, r;
if (ux < vx) l = ux, r = vx;
else l = vx, r = ux;
return (prefv[r+1][y] - prefv[l][y]) == 0;
}
bool canh(int ux, int uy, int vx, int vy) {
int x = ux;
int l, r;
if (uy < vy) l = uy, r = vy;
else l = vy, r = uy;
return (prefh[x][r+1] - prefh[x][l]) == 0;
}
bool can1(int ux, int uy, int vx, int vy) {
return canv(ux, uy, vx, uy) && canh(vx, uy, vx, vy);
}
bool can2(int ux, int uy, int vx, int vy) {
return canh(ux, uy, ux, vy) && canv(ux, vy, vx, vy);
}
bool can(int ux, int uy, int vx, int vy) {
return can1(ux, uy, vx, vy) || can2(ux, uy, vx, vy);
}
VPI cucak;
bool can() {
/*rep(ux, n) rep(uy, n) if (a[ux][uy] == 0) {*/
/* rep(vx, n) rep(vy, n) if (a[vx][vy] == 0) {*/
for (auto[ux, uy] : cucak) {
for (auto[vx, vy] : cucak) {
if (can(ux, uy, vx, vy));
else return 0;
}
}
return true;
}
void tarmacnel() {
cucak = VPI();
rep(i, n) rep(j, n) if (a[i][j] == 0) {
if (i == 0 || j == 0 || i == n-1 || j == n-1) cucak.pb({i, j});
else {
if (a[i-1][j] == 1 || a[i+1][j] == 1 || a[i][j-1] || a[i][j+1]) cucak.pb({i, j});
}
}
}
int biggest_stadium(int N, VVI A_ARG) {
n = N;
a = A_ARG;
rep(_, 1) {
int x, y;
int cnt = 0;
rep(i, n) rep(j, n) if (a[i][j] == 1) x = i, y = j, cnt++;
if (cnt == 0) return n*n;
if (cnt > 1) break;
int ans = 0;
setmax(ans, n*n - (x+1)*(y+1));
setmax(ans, n*n - (x+1)*(n-y));
setmax(ans, n*n - (n-x)*(y+1));
setmax(ans, n*n - (n-x)*(n-y));
return ans;
}
prefv = prefh = VVI(n+1, VI(n+1));
rep(i, n) {
rep(j, n) prefh[i][j+1] = prefh[i][j] + a[i][j];
}
rep(j, n) {
rep(i, n) prefv[i+1][j] = prefv[i][j] + a[i][j];
}
tarmacnel();
if (N <= 3) {
int ans = 0;
VVI atmp = a;
rep(s, (1<<(n*n))) {
a = atmp;
rep(i, n) rep(j, n) if (a[i][j] == 0) {
a[i][j] = (s & (1<<(n*i+j)));
}
tarmacnel();
if (can()) {
int cur = 0;
rep(i, n) rep(j, n) if (a[i][j] == 0) cur++;
setmax(ans, cur);
}
}
return ans;
}
if (!can()) return 0;
int ans = 0;
rep(i, n) rep(j, n) if (a[i][j] == 0) ans++;
return ans;
}
