#include<bits/stdc++.h>
#define zyq 1536
#define xzy 10005
using namespace std;
int dis[zyq][zyq];
int n;
struct point{
	int x,y;
};
queue<point>q;
int ans[xzy];
bool cmp(int x,int y){
	return x > y;
}
int main(){
	bool found=false;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			scanf("%d",&dis[i][j]);
			if(dis[i][j]==0) found=true,q.push((point){i,j}); 
		}
	}
	if(!found){
		printf("Bad Game!");return 0;
	}
	int cnt=1;
	while(!q.empty()){
		point t=q.front();
		q.pop();
		int an;
		for(int i=1;i<=n-2;i++){
			if(dis[t.x][i]) an+=dis[t.x][i];
		}
		for(int i=1;i<=n-2;i++){
			if(dis[i][t.y]) an+=dis[i][t.y];
		}
		ans[cnt++]=an;
	}
	sort(ans+1,ans+cnt+1,cmp);
	printf("%d\n",ans[1]);
	return 0;	
}