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

const int N = 2005;
int up[N][N], down[N][N];
void clear(int x) {
	for(int i = 0;i < N;++i)
	for(int j = 0;j < N;++j) {
		up[i][j] = 0;
		down[i][j] = 0;
	}
}
int dp[N];
struct rmq {
	std::vector<int> st[12];
	rmq(const std::vector<int> & v) {
		st[0] = v;
		for(int i = 1;(1 << i) - 1 < (int) v.size();++i) {
			st[i].resize(v.size() - (1 << i) + 1);
			for(int j = 0;j + (1 << i) - 1 < (int) v.size();++j) {
				st[i][j] = std::min(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
			}
		}
	}
	int qry(int l, int r) {
		const int lg = std::__lg(r - l + 1);
		return std::min(st[lg][l], st[lg][r - (1 << lg) + 1]);
	}
};
int biggest_stadium(int N, std::vector<std::vector<int>> F) {
	int px = -1, py = -1;
	for(int i = 0;i < N;++i)
	for(int j = 0;j < N;++j)
		if(F[i][j]) px = i, py = j;
    return N * N - std::min(px + 1, N - px) * std::min(py + 1, N - py);
}

#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