#include "soccer.h"

#include <bits/stdc++.h>
using namespace std;

template<typename Z> bool chmin(Z &a, Z b) { return ((a > b) ? (a = b, true) : false); }
template<typename Z> bool chmax(Z &a, Z b) { return ((a < b) ? (a = b, true) : false); }

#define debug(x) cout << #x << " = " << (x) << "\n"

int biggest_stadium(int N, vector<vector<int>> F) {
    // check if all cells are connected and convex
    vector<int> mn_row(N), mx_row(N);
    {
        for (int r = 0; r < N; r++) {
            int mn = N, mx = -1;
            for (int c = 0; c < N; c++) {
                if (!F[r][c]) { chmin(mn, c); chmax(mx, c); }
            }
            mn_row[r] = mn, mx_row[r] = mx;

            if (mn == N) continue; // no empty cell
            for (int c = mn; c <= mx; c++) {
                if (F[r][c]) return 0;
            }
        }
        for (int c = 0; c < N; c++) {
            int mn = N, mx = -1;
            for (int r = 0; r < N; r++) {
                if (!F[r][c]) { chmin(mn, r); chmax(mx, r); }
            }

            if (mn == N) continue; // no empty cell
            for (int r = mn; r <= mx; r++) {
                if (F[r][c]) return 0;
            }
        }
    }

    const auto connected = [&](int r1, int c1, int r2, int c2) {
        return (!F[r1][c2] || !F[r2][c1]);
    };

    for (int i = 0; i < N; i++) {
        if (mn_row[i] == N) continue;
        for (int j = 0; j < N; j++) {
            if (mx_row[j] == -1) continue;
            // cout << i << " " << mn_row[i] << " " << j << " " << mx_row[j] << "\n";
            if (!connected(i, mn_row[i], j, mx_row[j])) return 0;
        }
    }

    int cnt = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cnt += (F[i][j] == 0);
        }
    }
    return cnt;
}

#ifdef Zanite

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

int main()
{
    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