Problem: You are given a tournament — complete directed graph.

In one operation you can pick any vertex v and change the direction of all edges with v on one of the ends (i.e all edges u → v change their orientation to v → u and vice versa).

You want to make the tournament strongly connected with the smallest possible number of such operations if it is possible. 

Also, if it is possible, you need to find the number of ways to make this number of operations to make graph strongly connected (two ways are different if for some i vertex that we chose on i-th operation in one way is different from vertex that we chose on i-th operation in another way). You only need to find this value modulo 998 244 353.

Input

The first line of input contains one integer n (3 ≤ n ≤ 2000): the number of vertices in the tournament.

Following n lines contain a description of the given tournament, each of them contains a binary string of length n. If j-th character of i-th string is equal to '1', then the graph has an edge i → j.

It is guaranteed that there are no edges i → i and the graph has exactly one edge among i → j and j → i for different i and j.

Output

If it is not possible to convert tournament to strongly connected with the given operations, output "-1".

Otherwise, output two integers: the smallest number of operations that you need to make the given graph strongly connected and the number of ways to do this number of operations to make graph strongly connected, modulo 998 244 353.

Examples

Input


3
010
001
100


Output


0 1


Input


4
0010
1000
0100
1110


Output


-1


Input


6
010000
001000
100000
111001
111100
111010


Output


2 18

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, a[2005][2005];
namespace p1 {
int b[20][20], sz[1 << 6], low[20], dfn[20], tot, cs, fc[10];
void dfs(int x) {
  low[x] = dfn[x] = ++tot;
  for (int i = 1; i <= n; ++i)
    if (b[x][i] && i != x) {
      if (!dfn[i])
        dfs(i), low[x] = min(low[x], low[i]);
      else
        low[x] = min(low[x], dfn[i]);
    }
  if (low[x] == dfn[x]) ++cs;
}
void solve() {
  int len = 1 << n, ans1 = 1e9, ans2 = 0;
  fc[0] = fc[1] = 1;
  for (int i = 2; i <= n; ++i) fc[i] = fc[i - 1] * i;
  for (int i = 0; i < len; ++i) {
    sz[i] = sz[i >> 1] + (i & 1);
    for (int j = 1; j <= n; ++j)
      for (int k = 1; k <= n; ++k) b[j][k] = a[j][k];
    for (int j = 0; j < n; ++j)
      if ((1 << j) & i) {
        for (int k = 1; k <= n; ++k) b[j + 1][k] ^= 1, b[k][j + 1] ^= 1;
      }
    for (int j = 1; j <= n; ++j) low[j] = dfn[j] = 0;
    tot = 0;
    cs = 0;
    dfs(1);
    if (cs == 1 && tot == n) {
      if (sz[i] < ans1)
        ans1 = sz[i], ans2 = fc[sz[i]];
      else if (sz[i] == ans1)
        ans2 += fc[sz[i]];
    }
  }
  if (ans2 == 0)
    puts("-1");
  else
    printf("%d %d\n", ans1, ans2);
}
}  // namespace p1
namespace p2 {
int deg[2005], sk[2005];
bool cmp(int x, int y) { return deg[x] < deg[y]; }
bool check() {
  for (int i = 1; i <= n; ++i) sk[i] = i;
  sort(sk + 1, sk + n + 1, cmp);
  for (int i = 1, ans = 0; i < n; ++i) {
    ans += deg[sk[i]];
    if (ans == 1ll * i * (i - 1) / 2) return 0;
  }
  return 1;
}
void solve() {
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) deg[i] += a[i][j];
  if (check())
    puts("0 1");
  else {
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        if (a[i][j])
          deg[i]--, deg[j]++;
        else
          deg[i]++, deg[j]--;
      }
      ans += check();
      for (int j = 1; j <= n; ++j) {
        if (a[i][j])
          deg[i]++, deg[j]--;
        else
          deg[i]--, deg[j]++;
      }
    }
    printf("1 %d\n", ans);
  }
}
}  // namespace p2
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) scanf("%1d", &a[i][j]);
  if (n <= 6)
    p1::solve();
  else
    p2::solve();
}