#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf=0x7fffffff;
int n,ans;
char mp[110][110];
int dui(int x1,int y1,int x){
	int cnt=0;
	if(x==1)while(0<x1&&x1<=n&&0<y1&&y1<=n){if(mp[x1][y1]=='1')cnt++;x1--,y1--;}
	if(x==2)while(0<x1&&x1<=n&&0<y1&&y1<=n){if(mp[x1][y1]=='1')cnt++;x1--,y1++;}
	if(x==3)while(0<x1&&x1<=n&&0<y1&&y1<=n){if(mp[x1][y1]=='1')cnt++;x1++,y1--;}
	if(x==4)while(0<x1&&x1<=n&&0<y1&&y1<=n){if(mp[x1][y1]=='1')cnt++;x1++,y1++;}
	return cnt;
}
void find1(const int x,const int y){
	ans+=min(min(dui(x+1,y,3),dui(x,y,1)),min(dui(x,y+1,2),dui(x+1,y+1,4)));
}
void find2(const int x,const int y){
	ans+=min(min(dui(x-1,y-1,1),dui(x+1,y+1,4)),min(dui(x-1,y+1,2),dui(x+1,y-1,3)));
}
signed main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%s",mp[i]+1);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			find1(i,j);
			find2(i,j);
		}
	}
	printf("%d",ans);
	return 0;
}