#include"soccer.h"
#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 2000
using namespace std;
const int inf=(int)(1e9);
struct reads
{
	int l,r;
	bool operator < (const reads &t)const
    {
		return l!=t.l?l<t.l:r>t.r;	
	}
};
reads tong[N+1];
int n,length;
int biggest_stadium(int SN,vector<vector<int>>F)
{
	int cnt,l,r;
	n=SN;
	for (int i=1;i<=n;++i)
	{
		cnt=0,l=inf,r=0;
		for (int j=1;j<=n;++j)
			if (!F[i-1][j-1])
				cnt++,l=min(l,j),r=max(r,j);
		if (cnt&&r-l+1!=cnt) return 0;
		if (cnt) tong[++length]=(reads){l,r};
    }
	for (int i=1;i<=n;++i)
	{
		cnt=0,l=inf,r=0;
		for (int j=1;j<=n;++j)
			if (!F[j-1][i-1])
				cnt++,l=min(l,j),r=max(r,j);
		if (cnt&&r-l+1!=cnt) return 0;
	}
	sort(tong+1,tong+length+1);
	for (int i=1;i<=length-1;++i)
		if (tong[i].l>tong[i+1].l||tong[i].r<tong[i+1].r)
			return 0;
	cnt=0;
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			cnt+=(!F[i-1][j-1]);
    return cnt;
}