#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2010;
const long long mod = 998244353;
long long n, m;
bool mat[maxn][maxn], mark[maxn];
long long V, V1;
void dfs(long long v) {
  V++;
  mark[v] = 1;
  for (long long i = 1; i <= n; i++)
    if (mat[v][i] == 1 && mark[i] == 0) dfs(i);
}
void bdfs(long long v) {
  V1++;
  mark[v] = 1;
  for (long long i = 1; i <= n; i++)
    if (mat[v][i] == 0 && mark[i] == 0) bdfs(i);
}
bool check() {
  V = 0, V1 = 0;
  fill(mark, mark + n + 1, 0);
  dfs(1);
  fill(mark, mark + n + 1, 0);
  bdfs(1);
  if (V == n && V1 == n) return 1;
  return 0;
}
long long fac(long long x) {
  long long p = 1;
  for (long long i = 1; i <= x; i++) (p *= i) %= mod;
  return p;
}
long long deg[maxn], degg[maxn];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    string s;
    cin >> s;
    for (long long j = 1; j <= n; j++) {
      mat[i][j] = s[j - 1] - '0';
      degg[i] += mat[i][j];
    }
  }
  if (check()) return cout << 0 << " " << 1, 0;
  if (n <= 20) {
    long long mn = n;
    for (long long mask = 0; mask < (1 << n); mask++) {
      for (long long i = 0; i < n; i++)
        if ((1 << i) & mask) {
          for (long long j = 1; j <= n; j++) {
            mat[i + 1][j] ^= 1;
            mat[j][i + 1] ^= 1;
          }
        }
      if (check()) mn = min(mn, (long long)__builtin_popcountll(mask));
      for (long long i = 0; i < n; i++)
        if ((1 << i) & mask) {
          for (long long j = 1; j <= n; j++) {
            mat[i + 1][j] ^= 1;
            mat[j][i + 1] ^= 1;
          }
        }
    }
    long long ans = 0;
    for (long long mask = 0; mask < (1 << n); mask++) {
      if (mn != __builtin_popcountll(mask)) continue;
      for (long long i = 0; i < n; i++)
        if ((1 << i) & mask) {
          for (long long j = 1; j <= n; j++) {
            mat[i + 1][j] ^= 1;
            mat[j][i + 1] ^= 1;
          }
        }
      if (check()) ans++;
      for (long long i = 0; i < n; i++)
        if ((1 << i) & mask) {
          for (long long j = 1; j <= n; j++) {
            mat[i + 1][j] ^= 1;
            mat[j][i + 1] ^= 1;
          }
        }
    }
    if (ans == 0) return cout << -1, 0;
    cout << mn << " " << (ans * fac(mn)) % mod;
    return 0;
  }
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= n; j++) deg[j] = degg[j];
    for (long long j = 1; j <= n; j++) {
      if (mat[i][j]) {
        deg[j]++;
        deg[i]--;
      } else {
        deg[j]--;
        deg[i]++;
      }
    }
    vector<long long> ve;
    for (long long v = 1; v <= n; v++) ve.push_back(deg[v]);
    sort(ve.begin(), ve.end());
    reverse(ve.begin(), ve.end());
    long long sum = 0;
    long long T = 1;
    for (long long i = 0; i < n - 1; i++) {
      sum += ve[i];
      long long sz = i + 1;
      if (((sz * (sz - 1)) / 2 + sz * (n - sz)) == sum) T = 0;
    }
    ans += T;
  }
  cout << 1 << " " << ans;
}
