#include "soccer.h"
#ifdef LOCAL
#include "grader.cpp"
#endif
#include<bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,sse4,bmi2,popcnt")
#define int long long
#define iint signed
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define RREP1(i,n) for(int i=(n);i>=1;i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)((x).size()))
#define SQ(x) ((x)*(x))
#define pii pair<int,int>
#define pipii pair<int,pii>
#define ppi pair<pii,int>
#define Graph vector<vector<int>>
#define Graphw vector<vector<pii>>
#define IOS() ios::sync_with_stdio(0),cin.tie(0)
#define md(x) (((x)%(mod)+(mod))%(mod))
#define MD(x,M) (((x)%(M)+(M))%(M))
#define ld long double
#define pdd pair<ld,ld>
template<typename S> void chmin(S &x,S y) { x=min(x,y); }
template<typename S> void chmax(S &x,S y) { x=max(x,y); }
#define addmod(x,y) x=((x+(y))%mod)
#define Vi vector<int>
#define Vpii vector<pii>
#ifdef LOCAL
#define op(x) cout<<(#x)<<"="<<(x)<<", ";
#define ope(x) cout<<(#x)<<"="<<(x)<<endl;
#define oparr(x) {cout<<(#x)<<":";for(auto allen:(x)) cout<<allen<<" ";cout<<" size="<<(x).size()<<endl;}
#define entr cout<<endl;
#else
#define op(x) ;
#define ope(x) ;
#define oparr(x) ;
#define entr ;
#endif
template<typename T1,typename T2>
ostream& operator<<(ostream& os,pair<T1,T2> p) { return os<<'{'<<p.f<<','<<p.s<<'}'; }
template<typename T1,typename T2>
istream& operator>>(istream& os,pair<T1,T2> &p) { return os>>p.f>>p.s; }
template<typename S>
ostream& operator<<(ostream& os,vector<S> p) { for(auto allen:p) os<<allen<<' ';return os<<'\n'; }
template<typename S>
istream& operator>>(istream& os,vector<S> &p) { for(auto &allen:p) os>>allen;return os; }
template<typename T1,typename T2>
pair<T1,T2> operator+(pair<T1,T2> p1,pair<T1,T2> p2) { return pair<T1,T2>(p1.f+p2.f,p1.s+p2.s); }
const int mod=998244353;
const int maxn=1e5+5;
const int maxv=1e6+5;
const int inf=1ll<<60;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rd(int l,int r) {
return uniform_int_distribution<int>(l,r)(rng);
}
iint biggest_stadium(iint N, std::vector<std::vector<iint>> F)
{
int n=N;
vector<Vi> a(n+2,Vi(n+2));
int _an=0;
{
REP1(i,n) REP1(j,n) a[i][j]=F[i-1][j-1];
Vi l(n+2,inf),r(n+2,-inf);
int cnt=0;
REP1(i,n) REP1(j,n) if(a[i][j]==0) {
chmin(l[i],j);
chmax(r[i],j);
cnt++;
}
_an=cnt;
int mx=-1,mxid;
int sum=0;
REP1(i,n) if(l[i]<=r[i])sum+=r[i]-l[i]+1;
ope(cnt)ope(sum)
if(sum!=cnt) return 0;
REP1(i,n) if(r[i]-l[i]>mx) mx=r[i]-l[i],mxid=i;
ope(mxid)
oparr(l)oparr(r)
int itr=mxid+1,itl=mxid-1;
int nl=l[mxid],nr=r[mxid];
while(1) {
if(itl==0&&itr==n+1) break;
if(itl==0) {
if(nl>l[itr]||nr<r[itr]) return 0;
nl=l[itr],nr=r[itr];
itr++;
}
else if(itr==n+1) {
if(nl>l[itl]||nr<r[itl]) return 0;
nl=l[itl],nr=r[itl];
itl--;
}
else if(r[itl]-l[itl]>r[itr]-l[itr]) {
if(nl>l[itl]||nr<r[itl]) return 0;
nl=l[itl],nr=r[itl];
itl--;
}else {
if(nl>l[itr]||nr<r[itr]) return 0;
nl=l[itr],nr=r[itr];
itr++;
ope("r")
}
}
}
return _an;
}
/*
3
1 0 1
0 0 0
1 0 1
*/
