#include <bits/stdc++.h>
#define endl "\n"
using namespace std;

namespace std {

template <int D, typename T>
struct Vec : public vector<Vec<D - 1, T>> {
    static_assert(D >= 1);
    template <typename... Args>
    Vec(int n = 0, Args... args) : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
};

template <typename T>
struct Vec<1, T> : public vector<T> {
    Vec(int n = 0, T val = T()) : std::vector<T>(n, val) {}
};

template <class Fun>
class y_combinator_result {
    Fun fun_;

   public:
    template <class T>
    explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)) {}

    template <class... Args>
    decltype(auto) operator()(Args &&...args) {
        return fun_(std::ref(*this), std::forward<Args>(args)...);
    }
};

template <class Fun>
decltype(auto) y_combinator(Fun &&fun) {
    return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

}  // namespace std

template <typename T>
T inverse(T a, T m) {
    T u = 0, v = 1;
    while (a != 0) {
        T t = m / a;
        m -= t * a;
        swap(a, m);
        u -= t * v;
        swap(u, v);
    }
    assert(m == 1);
    return u;
}
 
template <typename T>
class Modular {
   public:
    using Type = typename decay<decltype(T::value)>::type;
 
    constexpr Modular() : value() {}
    template <typename U>
    Modular(const U& x) {
        value = normalize(x);
    }
 
    template <typename U>
    static Type normalize(const U& x) {
        Type v;
        if (-mod() <= x && x < mod())
            v = static_cast<Type>(x);
        else
            v = static_cast<Type>(x % mod());
        if (v < 0) v += mod();
        return v;
    }
 
    const Type& operator()() const { return value; }
    template <typename U>
    explicit operator U() const { return static_cast<U>(value); }
    constexpr static Type mod() { return T::value; }
 
    Modular& operator+=(const Modular& other) {
        if ((value += other.value) >= mod()) value -= mod();
        return *this;
    }
    Modular& operator-=(const Modular& other) {
        if ((value -= other.value) < 0) value += mod();
        return *this;
    }
    template <typename U>
    Modular& operator+=(const U& other) { return *this += Modular(other); }
    template <typename U>
    Modular& operator-=(const U& other) { return *this -= Modular(other); }
    Modular& operator++() { return *this += 1; }
    Modular& operator--() { return *this -= 1; }
    Modular operator++(int) {
        Modular result(*this);
        *this += 1;
        return result;
    }
    Modular operator--(int) {
        Modular result(*this);
        *this -= 1;
        return result;
    }
    Modular operator-() const { return Modular(-value); }
 
    template <typename U = T>
    typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {
        value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));
        return *this;
    }
    template <typename U = T>
    typename enable_if<is_same<typename Modular<U>::Type, long long>::value, Modular>::type& operator*=(const Modular& rhs) {
        long long q = static_cast<long long>(static_cast<long double>(value) * rhs.value / mod());
        value = normalize(value * rhs.value - q * mod());
        return *this;
    }
    template <typename U = T>
    typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {
        value = normalize(value * rhs.value);
        return *this;
    }
 
    Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }
 
    friend const Type& abs(const Modular& x) { return x.value; }
 
    template <typename U>
    friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);
 
    template <typename U>
    friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);
 
    template <typename V, typename U>
    friend V& operator>>(V& stream, Modular<U>& number);
 
   private:
    Type value;
};
 
template <typename T>
bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }
template <typename T, typename U>
bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }
template <typename T, typename U>
bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }
 
template <typename T>
bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
template <typename T, typename U>
bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }
 
template <typename T>
bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }
 
template <typename T>
Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U>
Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }
 
template <typename T>
Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U>
Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }
 
template <typename T>
Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U>
Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }
 
template <typename T>
Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U>
Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }
 
template <typename T, typename U>
Modular<T> power(const Modular<T>& a, const U& b) {
    assert(b >= 0);
    Modular<T> x = a, res = 1;
    U p = b;
    while (p > 0) {
        if (p & 1) res *= x;
        x *= x;
        p >>= 1;
    }
    return res;
}
 
template <typename T>
bool IsZero(const Modular<T>& number) {
    return number() == 0;
}
 
template <typename T>
string to_string(const Modular<T>& number) {
    return to_string(number());
}
 
// U == std::ostream? but done this way because of fastoutput
template <typename U, typename T>
U& operator<<(U& stream, const Modular<T>& number) {
    return stream << number();
}
 
// U == std::istream? but done this way because of fastinput
template <typename U, typename T>
U& operator>>(U& stream, Modular<T>& number) {
    typename common_type<typename Modular<T>::Type, long long>::type x;
    stream >> x;
    number.value = Modular<T>::normalize(x);
    return stream;
}
 
/*
using ModType = int;
 
struct VarMod { static ModType value; };
ModType VarMod::value;
ModType& md = VarMod::value;
using Mint = Modular<VarMod>;
*/
 
constexpr int md = 998244353;
using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;
 

void solve() {   
    int n; cin >> n;
    Vec<2, char> matrix(n + 1, n + 1);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> matrix[i][j];
        }
    }
    Vec<3, Mint> fRow(2, n + 1, n + 1), fCol(2, n + 1, n + 1);
    Vec<2, Mint> prefRow(n + 1, n + 1), prefCol(n + 1, n + 1);
    for (int i = 1; i <= n; i++) {
        fRow[1][i][0] = 1;
        for (int j = 1; j <= n; j++) {
            if (matrix[i][j] == '1' || matrix[i][j] == '?') {
                fRow[1][i][j] += fRow[1][i][j - 1];
            }
            if (matrix[i][j] == '0' || matrix[i][j] == '?') {
                fRow[0][i][j] += fRow[0][i][j - 1] + fRow[1][i][j - 1];
            }
        }
    }
    for (int j = 1; j <= n; j++) {
        fCol[1][0][j] = 1;
        for (int i = 1; i <= n; i++) {
            if (matrix[i][j] == '1' || matrix[i][j] == '?') {
                fCol[1][i][j] += fCol[1][i - 1][j];
            }
            if (matrix[i][j] == '0' || matrix[i][j] == '?') {
                fCol[0][i][j] += fCol[0][i - 1][j] + fCol[1][i - 1][j];
            }
        }
    }
    for (int i = 0; i <= n; i++) {
        prefRow[0][i] = 1;
        prefCol[i][0] = 1;
    }
    Vec<2, int> invalidRow(n + 1, n + 1), invalidCol(n + 1, n + 1);
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
        invalidRow[i][j] = invalidRow[i][j - 1];
        invalidCol[i][j] = invalidCol[i - 1][j];
        if (invalidRow[i][j] == 0 && matrix[i][j] == '0') {
            invalidRow[i][j] = 1;
        }
        if (invalidRow[i][j] == 1 && matrix[i][j] == '1') {
            invalidRow[i][j] = 2;
        }
        if (invalidCol[i][j] == 0 && matrix[i][j] == '0') {
            invalidCol[i][j] = 1;
        }
        if (invalidCol[i][j] == 1 && matrix[i][j] == '1') {
            invalidCol[i][j] = 2;
        }
    }
    Vec<2, Mint> g(2, n + 1);
    Vec<2, Mint> f(n + 1, n + 1);
    for (int i = 0; i <= n; i++) f[i][0] = f[0][i] = 1;
    for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
        f[i][j] += f[i - 1][j - 1] * fRow[1][i][j] * fCol[1][i][j];
        f[i][j] += f[i - 1][j - 1] * fRow[0][i][j] * fCol[0][i][j];
        f[i][j] += f[i - 1][j - 1] * fRow[1][i][j] * fCol[0][i - 1][j];
        f[i][j] += f[i - 1][j - 1] * fRow[0][i][j - 1] * fCol[1][i][j];
        g[0][i] = g[0][i] * (fCol[0][i][j] + fCol[1][i][j]);
        g[1][j] = g[1][j] * (fRow[0][i][j] + fRow[1][i][j]);
        if (invalidCol[i][j] == 2) g[0][i] = 0;
        if (invalidRow[i][j] == 2) g[1][j] = 0;
        f[i][j] += g[0][i];
        f[i][j] += g[1][j];
        if (fCol[1][i][j]) g[0][i] += fRow[0][i][j - 1] * f[i - 1][j - 1];
        if (fRow[1][i][j]) g[1][j] += fCol[0][i - 1][j] * f[i - 1][j - 1];
        if (invalidCol[i][j] == 2) g[0][i] = 0;
        if (invalidRow[i][j] == 2) g[1][j] = 0;
    }    
    cout << f[n][n];
}


int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1; 
    // cin >> t; 

    while (t--) {
        solve();
    }
}