#include "soccer.h"

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N;
bool E[2010][2010];
int sum[2010][2010];
int get(int a, int b, int c, int d) {
  return sum[a][c] - sum[a][d] - sum[b][c] + sum[b][d];
}

int whole() {
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) {
    sum[x + 1][y + 1] = sum[x + 1][y] + sum[x][y + 1] - sum[x][y] + (E[x][y] ? 1 : 0);
  }
  
  vector<int> cs(N, N), ds(N, -1);
  vector<int> as(N, N), bs(N, -1);
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (E[x][y]) {
    chmin(cs[x], y); chmax(ds[x], y);
    chmin(as[y], x); chmax(bs[y], x);
  }
  const int A = *min_element(as.begin(), as.end());
  const int B = *max_element(bs.begin(), bs.end());
  const int C = *min_element(cs.begin(), cs.end());
  const int D = *max_element(ds.begin(), ds.end());
cerr<<"["<<A<<", "<<B<<"] * ["<<C<<", "<<D<<"]"<<endl;
  
  for (int x = A; x <= B; ++x) {
    for (int y = cs[x]; y <= ds[x]; ++y) if (!E[x][y]) return 0;
  }
  for (int y = C; y <= D; ++y) {
    for (int x = as[y]; x <= bs[y]; ++x) if (!E[x][y]) return 0;
  }
  
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (E[x][y]) {
    const int a = as[y], b = bs[y] + 1;
    const int c = cs[x], d = ds[x] + 1;
    if (get(0, a, 0, c)) return 1;
    if (get(0, a, d, N)) return 1;
    if (get(b, N, 0, c)) return 1;
    if (get(b, N, d, N)) return 1;
  }
  
  int area = 0;
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) if (E[x][y]) {
    ++area;
  }
  
  return area;
}

int biggest_stadium(int N_, std::vector<std::vector<int>> F)
{
  N = N_;
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) {
    E[x][y] = !F[x][y];
  }
  return whole();
}