#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) {
    int pr = -1, pc = -1;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (F[i][j]) { pr = i; pc = j; }
        }
    }
    if (pr == -1) return N*N;

    pr++; pc++;
    const auto area = [&](int w, int h) { return (w+h)*N - w*h; };
    return max({
        area(pr - 1, pc - 1),
        area(N - pr, pc - 1),
        area(pr - 1, N - pc),
        area(N - pr, N - pc)
    });
}

#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