#include <bits/stdc++.h>
#ifndef CYBER
#include "soccer.h"
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);


int biggest_stadium(int n, vector<vector<int>> f)
{
	lg pos = 1, ans = 0, sum = 0;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			ans += !f[i][j], sum += f[i][j];
	vector<int> tree[n];
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < n; j++)
		{
			if(f[i][j])
			{
				tree[i].push_back(j);
			}
		}
	}
	if(n > 30)
	{
		for(int i = 0; i < n; i++)
		{
			lg bef = 0, aft = 0;
			for(auto it : tree[i])
			{
				lg x = it;
				while(x >= 0)
				{
					bef += !f[i][x];
					x--;
				}
				x = it;
				while(x < n)
				{
					aft += !f[i][x];
					x++;
				}
			}
			if(bef && aft)	pos = 0;
			tree[i].clear();
		}
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < n; j++)
			{
				if(f[i][j])
				{
					tree[j].push_back(i);
				}
			}
		}
		for(int i = 0; i < n; i++)
		{
			lg bef = 0, aft = 0;
			for(auto it : tree[i])
			{
				lg x = it;
				while(x >= 0)
				{
					bef += !f[x][i];
					x--;
				}
				x = it;
				while(x < n)
				{
					aft += !f[x][i];
					x++;
				}
			}
			if(bef && aft)	pos = 0;
		}	
	}
	else{
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < n; j++)
			{
				if(f[i][j])	continue;
				for(int k = 0; k < n; k++)
				{
					for(int z = 0; z < n; z++)
					{
						if(f[k][z])	continue;
						if(i == k && j == z)	continue;
						if(i == k)
						{
							for(int g = min(j, z); g <= max(j, z); g++)
							{
								if(f[i][g])	pos = 0;
								if(!pos)	break;
							}
							continue;
						}
						if(j == z)
						{
							for(int g = min(i, k); g <= max(i, k); g++)
							{
								if(f[g][j])	pos = 0;
								if(!pos)	break;
							}
							continue;
						}
						lg l = min(i, k), r = max(i, k);
						if(!f[i][z])	continue;
						if(!f[k][j])	continue;
						pos = 0;
						break;
					}
					if(!pos)	break;
				}
				if(!pos)	break;
			}
			if(!pos)	break;
		}
	}
	if(!pos)	ans = 1;
	if(sum == 1 && !pos)
	{
		int idI = 0, idJ = 0;
		for(int i = 0; i < n; i++)
		{
			for(int j = 0; j < n; j++)
			{
				if(f[i][j])
				{
					idI = i, idJ = j;
				}
			}
		}
		int remX = min(idI, n-1-idI)+1;
		int remY = min(idJ, n-1-idJ)+1;
		ans = n*n-min({idI*idI+remY, idJ*idJ+remX, (n-1-idI)*(n-1-idI)+remY, (n-1-idJ)*(n-1-idJ)+remX});
	}
	return ans;
}