import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(int M_) {
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;

void main() {
  debug {
    foreach (n; 2 .. 10) {
      writefln("==== n = %s ====", n);
      // foreach (x0; 1 .. (n / 2) + 1) foreach (y0; x0 .. (n / 2) + 1) {
      foreach (x0; 1 .. n) foreach (y0; 1 .. n) {
        /*
          (x0 + y0, 0)
          (x0 - y0, 0)
        */
        const s = min(x0 + y0, 2 * n - (x0 + y0));
        const t = abs(x0 - y0);
        auto a = new int[][](n + 1, n + 1);
        foreach (x; 1 .. n) foreach (y; 1 .. n) {
          if (x + y == s || 2 * n - (x + y) == s || x - y == s || -(x - y) == s ||
              x + y == t || 2 * n - (x + y) == t || x - y == t || -(x - y) == t) {
            a[x][y] = 1;
          }
        }
        /*
        writefln("(%s, %s)", x0, y0);
        foreach (x; 1 .. n) {
          foreach (y; 1 .. n) {
            write(a[x][y]);
          }
          writeln();
        }
        //*/
        write("{");
        foreach (x; 1 .. n) foreach (y; 1 .. n) {
          if (!(x == 1 && y == 1)) {
            write(",");
          }
          write(a[x][y]);
        }
        writeln("},");
      }
    }
    // return;
  }
  
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new string[N];
      foreach (x; 1 .. N) {
        A[x] = "^" ~ readToken();
      }
      
      Mint ans;
      if (N <= 1) {
        
      } else {
        auto p = new char[][](N, N);
        foreach (x; 0 .. N) foreach (y; 0 .. N) {
          p[x][y] = '?';
        }
        bool ok = true;
        foreach (x; 1 .. N) foreach (y; 1 .. N) {
          int rx = x, ry = y;
          if (rx + ry > N) {
            rx = N - rx;
            ry = N - ry;
          }
          if (rx > ry) {
            swap(rx, ry);
          }
          if (A[x][y] != '?') {
            if (p[rx][ry] == '?') {
              p[rx][ry] = A[x][y];
            }
            ok = ok && (p[rx][ry] == A[x][y]);
          }
        }
        if (ok) {
          int cnt;
          ans = 1;
          foreach (x; 1 .. N) foreach (y; 1 .. N) {
            if (x + y <= N && x <= y) {
              ++cnt;
              if (p[x][y] == '?') {
                ans *= 2;
              }
            } else {
              p[x][y] = '#';
            }
          }
          debug {
            foreach (x; 1 .. N) {
              writeln(p[x][1 .. N]);
            }
            writeln("cnt = ", cnt);
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
