#include <bits/stdc++.h>
using namespace std;
const int LIM = 15;
const int maxn = 2005;
const double pi = 3.14159265358979324;
int a[maxn][maxn];
int mark[maxn][maxn];
int n, area, ret0, ret1;
namespace M {
int x1, y1;
};
void init() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
}
int dx[4] = {0, 0, -1, 1};
int dy[4] = {-1, 1, 0, 0};
void dfs(int x, int y) {
  if (!mark[x][y]) return;
  mark[x][y] = 0;
  area++;
  if (x > M::x1 || (x == M::x1 && y > M::y1)) M::x1 = x, M::y1 = y;
  for (int i = 0; i < 4; i++) {
    int nx = x + dx[i], ny = y + dy[i];
    if (nx > 0 && nx <= n && ny > 0 && ny <= n) dfs(nx, ny);
  }
}
inline double Fabs(double x) { return x < 0 ? -x : x; }
void work() {
  for (int i = 1; i + 4 <= n; i++)
    for (int j = 1; j + 4 <= n; j++) {
      int cnt = 0;
      for (int dx = 0; dx <= 4; dx++)
        for (int dy = 0; dy <= 4; dy++) cnt += a[i + dx][j + dy];
      if (cnt >= LIM) mark[i][j] = 1;
    }
  ret0 = ret1 = 0;
  for (int i = 1; i + 4 <= n; i++)
    for (int j = 1; j + 4 <= n; j++)
      if (mark[i][j]) {
        M::x1 = i;
        M::y1 = j;
        area = 0;
        dfs(i, j);
        double len =
            sqrt((M::x1 - i) * (M::x1 - i) + (M::y1 - j) * (M::y1 - j));
        if (len < 10) continue;
        if (Fabs(area - len * len * pi / 4) < Fabs(area - len * len / 2))
          ret0++;
        else
          ret1++;
      }
}
void print() { printf("%d %d\n", ret0, ret1); }
int main() {
  init();
  work();
  print();
  return 0;
}
