#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;
bool can1(int ux, int uy, int vx, int vy) {
if (a[ux][uy] == 1) return false;
if (ux < vx) return can1(ux+1, uy, vx, vy);
if (ux > vx) return can1(ux-1, uy, vx, vy);
if (uy < vy) return can1(ux, uy+1, vx, vy);
if (uy > vy) return can1(ux, uy-1, vx, vy);
return true;
}
bool can2(int ux, int uy, int vx, int vy) {
if (a[ux][uy] == 1) return false;
if (uy < vy) return can2(ux, uy+1, vx, vy);
if (uy > vy) return can2(ux, uy-1, vx, vy);
if (ux < vx) return can2(ux+1, uy, vx, vy);
if (ux > vx) return can2(ux-1, uy, vx, vy);
return true;
}
bool can(int ux, int uy, int vx, int vy) {
return can1(ux, uy, vx, vy) || can2(ux, uy, vx, vy);
}
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;
}
rep(ux, n) rep(uy, n) if (a[ux][uy] == 0) {
rep(vx, n) rep(vy, n) if (a[vx][vy] == 0) {
if (can(ux, uy, vx, vy));
else return 0;
}
}
int ans = 0;
rep(i, n) rep(j, n) if (a[i][j] == 0) ans++;
return ans;
}
