#include <bits/stdc++.h>
using namespace std;
int dx[8] = {0, -1, -1, -1, 0, 1, 1, 1};
int dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int n, p[8][1005][1005], a[1005][1005], num, x, y, ans;
char c[1005][1005];
double lg[1005][1005], sum[8][1005][1005], res = -1;
const int mod = 1e9 + 7;
bool flag1;
void pre1() {
  double lg2 = log(2);
  double lg3 = log(3);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      cin >> c[i][j];
      a[i][j] = c[i][j] - '0';
      if (a[i][j] == 3)
        lg[i][j] = lg3;
      else if (a[i][j] == 2)
        lg[i][j] = lg2;
      if (a[i][j] != 0) {
        for (int k = 0; k < 4; k++) p[k][i][j] = p[k][i + dx[k]][j + dy[k]] + 1;
        ans = 1;
      }
    }
  for (int i = n; i >= 1; i--)
    for (int j = n; j >= 1; j--)
      if (a[i][j] != 0)
        for (int k = 4; k < 8; k++) p[k][i][j] = p[k][i + dx[k]][j + dy[k]] + 1;
}
void pre2() {
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      for (int k = 0; k < 4; k++)
        sum[k][i][j] = sum[k][i + dx[k]][j + dy[k]] + lg[i][j];
  for (int i = n; i >= 1; i--)
    for (int j = n; j >= 1; j--)
      for (int k = 4; k < 8; k++)
        sum[k][i][j] = sum[k][i + dx[k]][j + dy[k]] + lg[i][j];
}
void solve() {
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (a[i][j] != 0) {
        int tmp = 1e5;
        double tmp1 = 0;
        for (int k = 1; k < 8; k += 2) tmp = min(tmp, p[k][i][j]);
        for (int k = 1; k < 8; k += 2)
          tmp1 += sum[k][i][j] - sum[k][i + tmp * dx[k]][j + tmp * dy[k]];
        tmp1 -= 3 * lg[i][j];
        if (tmp1 > res) {
          flag1 = 1;
          num = tmp;
          res = tmp1;
          x = i;
          y = j;
        }
        tmp = 1e5;
        tmp1 = 0;
        for (int k = 0; k < 7; k += 2) tmp = min(tmp, p[k][i][j]);
        for (int k = 0; k < 7; k += 2)
          tmp1 += sum[k][i][j] - sum[k][i + tmp * dx[k]][j + tmp * dy[k]];
        tmp1 -= 3 * lg[i][j];
        if (tmp1 > res) {
          flag1 = 0;
          num = tmp;
          res = tmp1;
          x = i;
          y = j;
        }
      }
  if (flag1) {
    for (int i = 1; i < num; i++)
      for (int k = 1; k < 8; k += 2)
        ans = (1LL * ans * a[x + i * dx[k]][y + i * dy[k]]) % mod;
    ans = (1LL * ans * a[x][y]) % mod;
  } else {
    for (int i = 1; i < num; i++)
      for (int k = 0; k < 8; k += 2)
        ans = (1LL * ans * a[x + i * dx[k]][y + i * dy[k]]) % mod;
    ans = (1LL * ans * a[x][y]) % mod;
  }
  cout << ans << endl;
}
int main() {
  cin >> n;
  pre1();
  pre2();
  solve();
}
