#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "soccer.h"
int biggest_stadium(int N, std::vector<std::vector<int>> F) {
V<pi> ts;
f0r(i, N) f0r(j, N) if (F[i][j]) ts.pb({i, j});
if (ts.size() == 0) {
return N*N;
}
if (ts.size() == 1) {
auto [ii, jj] = ts[0];
vi vl(4);
f0r(k, 4) {
f0r(i, N) f0r(j, N) {
bool ok = (i != ii && ((i < ii) ^ (k & 1))) || (j != jj && ((j < jj) ^ !(j & 2)));
vl[k] += ok;
}
}
return *max_element(all(vl));
}
return 0;
}
