#include "soccer.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PLL;
typedef vector <int> vi;
typedef vector <vi> vvi;
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i = a;i < b;i++)
#define trav(nx, v) for(auto &nx : v)
#define all(a) begin(a), end(a)
#define sz(v) (int) v.size()

int n;
int presum[1005][1005];
void init(const vvi &stadium){
	for(int i = 0;i < n;i++){
		for(int j = 0;j < n;j++){
			presum[i + 1][j + 1] = stadium[i][j];
		}
	}
	rep(i,1,n + 1){
		rep(j,1,n + 1){
			presum[i][j] += presum[i - 1][j] + presum[i][j - 1] - presum[i - 1][j - 1];
		}
	}
}

LL query(PLL st, PLL ed){
	st.fi++; st.se++;
	ed.fi++; ed.se++;
	if(st.fi > ed.fi) return 0;
	if(st.se > ed.se) return 0;
	return (ed.fi - st.fi + 1) * (ed.se - st.se + 1);
}

typedef pair<int, int> PII;

int biggest_stadium(int N, std::vector<std::vector<int>> F){
	vvi tmp = F;
	n = N;
	init(tmp);
	PII st = {-1, -1};
	rep(i,0,n){
		rep(j,0,n){
			if(F[i][j] == 1){
				st = {i, j};
				break;
			}
		}
	}
	if(st.fi == -1) return n * n;
	vector <LL> total;
	total.pb(query({0, 0}, {n - 1, st.se - 1}) + query({0, st.se}, {st.fi - 1, n - 1}));
	total.pb(query({0, 0}, {st.fi - 1, n - 1}) + query({st.fi, st.se + 1}, {n - 1, n - 1}));
	total.pb(query({0, st.se + 1}, {n - 1, n - 1}) + query({st.fi + 1, 0}, {n - 1, st.se}));
	total.pb(query({0, 0}, {n - 1, st.se - 1}) + query({st.fi + 1, st.se}, {n - 1, n - 1}));
	//~ trav(cur, total) cout << cur << " ";
	//~ cout << endl;
	LL ans = *max_element(all(total));
	return ans;
}