#include <bits/stdc++.h>
using namespace std;
int n, a[2222][2222], a1, a2, e[2222][2222], f[2222][2222], N, A, B;
double xx, yy, u, mi, ma, r, ss, q1, q2;
void rec(int x, int y, int o) {
  if (x < 1 || x > N || y < 1 || y > N || e[x][y] == 0 || f[x][y] == o) return;
  f[x][y] = o;
  if (o == 1) xx += x, yy += y;
  u++;
  ss += sqrt(((xx - x) * (xx - x)) + ((yy - y) * (yy - y)));
  if (e[x][y - 1] == 0 || e[x][y + 1] == 0 || e[x + 1][y] == 0 ||
      e[x - 1][y] == 0)
    mi = min(mi, sqrt(((xx - x) * (xx - x)) + ((yy - y) * (yy - y))));
  ma = max(ma, sqrt(((xx - x) * (xx - x)) + ((yy - y) * (yy - y))));
  rec(x, y - 1, o);
  rec(x, y + 1, o);
  rec(x - 1, y, o);
  rec(x + 1, y, o);
}
int main() {
  scanf("%d\n", &n);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
  for (int it = 0; it < 50; it++)
    for (int i = 2; i <= n; i++)
      for (int j = 2; j <= n; j++)
        if (a[i][j] + a[i - 1][j] + a[i + 1][j] + a[i][j - 1] + a[i][j + 1] > 2)
          a[i][j] = 1;
        else
          a[i][j] = 0;
  for (int it = 0; it < 50; it++)
    for (int i = 2; i <= n; i++)
      for (int j = 2; j <= n; j++)
        if (a[i][j] + a[i - 1][j] + a[i + 1][j] + a[i][j - 1] + a[i][j + 1] +
                a[i - 1][j - 1] + a[i - 1][j + 1] + a[i + 1][j - 1] +
                a[i + 1][j + 1] + a[i + 2][j] + a[i - 2][j] + a[i][j - 2] +
                a[i][j + 2] >
            6)
          a[i][j] = 1;
        else
          a[i][j] = 0;
  N = n / 2;
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= N; j++) {
      A = B = 0;
      for (int x = 0; x < 2; x++)
        for (int y = 0; y < 2; y++)
          if (a[i * 2 + x][j * 2 + y])
            A++;
          else
            B++;
      if (A > B)
        e[i][j] = 1;
      else
        e[i][j] = 0;
    }
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= N; j++)
      if (e[i][j] && !f[i][j]) {
        xx = yy = 0;
        u = 0;
        rec(i, j, 1);
        if (u < 20) continue;
        xx /= u;
        yy /= u;
        mi = 1e9;
        ma = 0;
        rec(i, j, 2);
        q1 = sqrt(2) * mi - ma;
        q2 = ma - mi;
        r = sqrt(2) * mi - ma - (ma - mi);
        if (r > 0)
          a2++;
        else
          a1++;
      }
  cout << a2 << " " << a1 << endl;
  return 0;
}
