#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define ull unsigned long long 
#define sz(a) ((int) a.size())
#define vi vector<int>
#define me(a, x) memset(a, x, sizeof(a))
using namespace std;
const int N = 2007;

int n;

struct node {
	int l, r, v;
};

int lst[N][N];
vector < node > f[N][N]; 

int biggest_stadium(int N, vector < vi > F) {
	L(i, 0, N - 1) {
		int l = 0;
		L(j, 0, N) {
			if(j == N || F[i][j] == 1) {
				if(l < j) {
					node qwq;
					qwq.l = l;
					qwq.r = j - 1;
					qwq.v = qwq.r - qwq.l + 1; 
					f[i][i].emplace_back(qwq);
				}
				l = j + 1;
			}
			if(j < N) lst[i][j] = l;
		}
	}
	
	int ans = 0;
	L(len, 1, N) {
		L(l, 0, N - len) {
			int r = l + len - 1;
			for(auto &o : f[l][r]) {
				ans = max(ans, o.v);
				int tl = o.l;
				int tr = o.r;
				
				int nl = l;
				int nr = r;
				while(nl > 0 && lst[nl - 1][tr] <= tl) --nl;
				while(nr < N - 1 && lst[nr + 1][tr] <= tl) ++nr;
				
				if(nl != l || nr != r) {
					o.v += ((nr - nl) - (r - l)) * (tr - tl + 1);
					f[nl][nr].emplace_back(o);
					continue;
				}
				
				if(nl > 0) {
					for(int r = tr, l; r >= tl; r = l - 2) {
						l = max(tl, lst[nl - 1][r]);
						cout << l << ' ' << r << endl;
						if(l > r) continue;
						node to;
						to.l = l, to.r = r, to.v = o.v + r - l + 1;
						f[nl - 1][nr].emplace_back(to);
					}
				}
				
				if(nr < N - 1) {
					for(int r = tr, l; r >= tl; r = l - 2) {
						l = max(tl, lst[nr + 1][r]);
						if(l > r) continue;
						node to;
						to.l = l, to.r = r, to.v = o.v + r - l + 1;
						f[nl][nr + 1].emplace_back(to);
					}
				}
			}
		}
	}
	return ans;
}

//int main() {
//	cout << biggest_stadium(5, {vi{0, 0, 0, 0, 0}, 
// vi{1, 0, 0, 0, 0}, 
// vi{0, 0, 0, 0, 0}, 
// vi{0, 0, 0, 0, 0}, 
// vi{0, 0, 1, 0, 0}});
//}