#include <bits/stdc++.h>
using namespace std;
int n, r, a[1050][1050], len[1050][1050][10];
double mx = -1, res, sum[1050][1050][10];
char s[1050][1050];
long long ans;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%s", s[i] + 1);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) a[i][j] = s[i][j] - '0';
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (a[i][j]) {
        sum[i][j][0] = sum[i - 1][j - 1][0] + log(a[i][j]);
        sum[i][j][1] = sum[i - 1][j][1] + log(a[i][j]);
        sum[i][j][2] = sum[i - 1][j + 1][2] + log(a[i][j]);
        sum[i][j][3] = sum[i][j - 1][3] + log(a[i][j]);
        len[i][j][0] = len[i - 1][j - 1][0] + 1;
        len[i][j][1] = len[i - 1][j][1] + 1;
        len[i][j][2] = len[i - 1][j + 1][2] + 1;
        len[i][j][3] = len[i][j - 1][3] + 1;
      }
  for (int i = n; i >= 1; i--)
    for (int j = n; j >= 1; j--)
      if (a[i][j]) {
        len[i][j][5] = len[i][j + 1][5] + 1;
        len[i][j][6] = len[i + 1][j - 1][6] + 1;
        len[i][j][7] = len[i + 1][j][7] + 1;
        len[i][j][8] = len[i + 1][j + 1][8] + 1;
      }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (a[i][j]) {
        r = min(min(len[i][j][0], len[i][j][2]),
                min(len[i][j][6], len[i][j][8])) -
            1;
        res = sum[i + r][j + r][0] - sum[i - r - 1][j - r - 1][0] +
              sum[i + r][j - r][2] - sum[i - r - 1][j + r + 1][2] -
              log(a[i][j]);
        if (mx < res) {
          mx = res;
          ans = a[i][j];
          for (int k = -r; k <= r; k++)
            if (k)
              ans = ans * a[i + k][j + k] % 1000000007 * a[i - k][j + k] %
                    1000000007;
        }
        r = min(min(len[i][j][1], len[i][j][3]),
                min(len[i][j][5], len[i][j][7])) -
            1;
        res = sum[i + r][j][1] - sum[i - r - 1][j][1] + sum[i][j + r][3] -
              sum[i][j - r - 1][3] - log(a[i][j]);
        if (mx < res) {
          mx = res;
          ans = a[i][j];
          for (int k = -r; k <= r; k++)
            if (k)
              ans = ans * a[i][j + k] % 1000000007 * a[i + k][j] % 1000000007;
        }
      }
  printf("%lld\n", ans);
  return 0;
}
