#include "soccer.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
int biggest_stadium(int N, std::vector<std::vector<int>> F) {
int n = N;
int x = -1, y = -1;
for (int i=0; i<n; i++) for (int j=0; j<n; j++) if (F[i][j]) x = i, y = j;
if (x == -1 && y == -1) return n*n;
int ans = 0;
ans = max(ans, n*n - (x+1)*(y+1));
swap(x, y); y = n-1 - y;
ans = max(ans, n*n - (x+1)*(y+1));
swap(x, y); y = n-1 - y;
ans = max(ans, n*n - (x+1)*(y+1));
swap(x, y); y = n-1 - y;
ans = max(ans, n*n - (x+1)*(y+1));
swap(x, y); y = n-1 - y;
return ans;
// {F.insert(F.begin(), vector<int>(n, 1));
// F.push_back(vector<int>(n, 1));
// for (auto &v: F) {
// v.insert(v.begin(), 1);
// v.push_back(1);
// }}
// auto solve = [] (int n, vector<vector<int>> f) {
// };
}
