#include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k, l;
bool p[2222][2222];
bool u[2222][2222];
long long s, mnx, mny, mxx, mxy;
int o[2222 * 2222][2], d;
void bfs(int ax, int ay) {
  d = 1;
  o[0][0] = ax;
  o[0][1] = ay;
  u[ax][ay] = true;
  int k = 0, i, j;
  while (k < d) {
    i = o[k][0];
    j = o[k][1];
    ++s;
    mnx = ((mnx) < (i) ? (mnx) : (i));
    mxx = ((mxx) > (i) ? (mxx) : (i));
    mny = ((mny) < (j) ? (mny) : (j));
    mxy = ((mxy) > (j) ? (mxy) : (j));
    if (i && !u[i - 1][j] && p[i - 1][j] == 1) {
      o[d][0] = i - 1;
      o[d][1] = j;
      u[i - 1][j] = true;
      ++d;
    }
    if (i < n - 1 && !u[i + 1][j] && p[i + 1][j] == 1) {
      o[d][0] = i + 1;
      o[d][1] = j;
      u[i + 1][j] = true;
      ++d;
    }
    if (j && !u[i][j - 1] && p[i][j - 1] == 1) {
      o[d][0] = i;
      o[d][1] = j - 1;
      u[i][j - 1] = true;
      ++d;
    }
    if (j < n - 1 && !u[i][j + 1] && p[i][j + 1] == 1) {
      o[d][0] = i;
      o[d][1] = j + 1;
      u[i][j + 1] = true;
      ++d;
    }
    ++k;
  }
}
bool iscircle(int ax, int ay, int bx, int by) {
  double cx = (ax + bx) / 2.;
  double cy = (ay + by) / 2.;
  double mxd = 0;
  double mnd = 1e9;
  int x, y;
  for (x = ax; x <= bx; ++x)
    for (y = ay; y <= by; ++y)
      if (p[x][y]) {
        bool per = ((!x || !p[x - 1][y]) || (x == n - 1 || !p[x + 1][y]) ||
                    (!y || !p[x][y - 1]) || (y == n - 1 || !p[x][y + 1]));
        if (per) {
          double d = ((x - cx) * (x - cx)) + ((y - cy) * (y - cy));
          mxd = ((mxd) > (d) ? (mxd) : (d));
          mnd = ((mnd) < (d) ? (mnd) : (d));
        }
      }
  return sqrt((mxd)*1.) - sqrt((mnd)*1.) < 3;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (i = 0; i < n; ++i)
    for (j = 0; j < n; ++j) {
      cin >> k;
      p[i][j] = k;
    }
  int sq = 0;
  int cr = 0;
  for (i = 0; i < n; ++i)
    for (j = 0; j < n; ++j)
      if (!u[i][j] && p[i][j] == 1) {
        s = 0;
        mnx = mny = 1e9;
        mxx = mxy = -1e9;
        bfs(i, j);
        long long s2 = (mxx - mnx + 1) * (mxy - mny + 1);
        double k = (double)s2 / (double)s;
        if (iscircle(mnx, mny, mxx, mxy))
          ++cr;
        else
          ++sq;
      }
  cout << cr << ' ' << sq << endl;
  return 0;
}
