#include<bits/stdc++.h>

using namespace std;

int n,ans,s[1500][1500],mx=-1,x;
bool flag=false;
struct node{
	int x,y;
}safe[10010];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			cin>>s[i][j];
			if(s[i][j]==0) flag=true,x++,safe[x].x=i,safe[x].y=j;
		}
	}
	if(flag==false)
	{
		cout<<"Bad Game!";
		return 0;
	}
	for(int i=1;i<=x;i++)
	{
		for(int j=safe[i].x+1;j<=n;j++)
		{
			ans+=s[j][safe[i].y];
		}
		for(int j=safe[i].y+1;j<=n;j++)
		{
			ans+=s[safe[i].x][j];
		}
		mx=max(mx,ans);
		ans=0;
	}
	cout<<mx;
	return 0;
}