//ANMHLIJKTJIY!
#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
#include "soccer.h"
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define F first
#define S second
#define ll int
#define N 510
using namespace std;
ll n,a[N][N],f[2][N][N][2],mx[N][N];
int biggest_stadium(int _n,vector<vector<int> > grid)
{
	ll i,j,k,ans=0;
	n=_n;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			a[i][j]=grid[i][j];
		}
	}
	memset(f[0],-63,sizeof(f[0]));
	for(i=0;i<n;i++)
	{
		ll u=i&1,v=u^1;
		for(j=0;j<n;j++)
		{
			for(k=j;k<n;k++)
			{
				f[v][j][k][0]=0;
				f[v][j][k][1]=0;
			}
		}
		for(j=0;j<n;j++)
		{
			f[v][j][j][0]=max(f[u][j][j][0],0);
		}
		for(j=2;j<=n;j++)
		{
			for(k=0;k+j-1<n;k++)
			{
				f[v][k][k+j-1][0]=max(f[u][k][k+j-1][0],max(f[v][k][k+j-2][0],f[v][k+1][k+j-1][0]));
			}
		}
		f[v][0][n-1][1]=max(max(f[u][0][n-1][0],f[u][0][n-1][1]),0);
		for(j=n-1;j>=1;j--)
		{
			for(k=0;k+j-1<n;k++)
			{
				ll val=max(f[u][k][k+j-1][0],f[u][k][k+j-1][1]);
				f[v][k][k+j-1][1]=max(val,max((k+j==n?0:f[v][k][k+j][1]),(k==0?0:f[v][k-1][k+j-1][1])));
			}
		}
		for(j=0;j<n;j++)
		{
			for(k=j;k<n;k++)
			{
				f[v][j][k][0]+=k-j+1;
				f[v][j][k][1]+=k-j+1;
			}
		}
		for(j=0;j<n;j++)
		{
			bool hv=false;
			for(k=j;k<n;k++)
			{
				if(a[i][k])
				{
					hv=true;
				}
				if(hv)
				{
					f[v][j][k][0]=f[v][j][k][1]=-INF;
				}
				else
				{
					ans=max(ans,f[v][j][k][0]);
					ans=max(ans,f[v][j][k][1]);
				}
			}
		}
	}
    return ans;
}