#include "soccer.h"
#include <cassert>
#include <cstdio>
#include <algorithm>
#include <vector>

int biggest_stadium(int N, std::vector<std::vector<int>> F) {
	std::vector<int> L(N, N + 1), R(N, -1);
	int ans = 0;
	for(int i = 0;i < N;++i) {
		int l = 0, r = N - 1;
		for(;r >= 0 && F[i][r] == 1;) -- r;
		if(r < 0) {
			continue;
		}
		for(;l < N && F[i][l] == 1;) ++ l;
		for(int j = l;j <= r;++j) {
			if(F[i][j]) return 0;
		}
		L[i] = l, R[i] = r;
		ans += r - l + 1;
	}
	int max = max_element(R.begin(), R.end()) - R.begin();
	int min = min_element(L.begin(), L.end()) - L.begin();
	for(int i = max;i >= 1;--i) if(R[i - 1] > R[i]) return 0;
	for(int i = max;i + 1 < N;++i) if(R[i + 1] > R[i]) return 0;
	for(int i = min;i >= 1;--i) if(L[i - 1] < L[i]) return 0;
	for(int i = min;i + 1 < N;++i) if(L[i + 1] < L[i]) return 0;
	for(int i = 1;i < N;++i) {
		if(R[i - 1] >= 0 && L[i] < N && R[i - 1] < L[i]) return 0;
		if(R[i] >= 0 && L[i - 1] < N && R[i] < L[i - 1]) return 0;
	}
    return ans;
}

#ifdef zqj
int main() {
	freopen("1.in", "r", stdin);
    int N;
    assert(1 == scanf("%d", &N));
    std::vector<std::vector<int>> F(N, std::vector<int>(N));
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            assert(1 == scanf("%d", &F[i][j]));
        }
    }
    fclose(stdin);

    int res = biggest_stadium(N, F);

    printf("%d\n", res);
    fclose(stdout);
    return 0;
}
#endif