#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
    if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
    if(x > y) x = y;
}

inline int popcnt(int x){
    return __builtin_popcount(x);
}

inline int ctz(int x){
    return __builtin_ctz(x);
}

template <int P>
class mod_int
{
    using Z = mod_int;

private:
    static int mo(int x) { return x < 0 ? x + P : x; }

public:
    int x;
    int val() const { return x; }
    mod_int() : x(0) {}
    template <class T>
    mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<int>(x_) : mo(static_cast<int>(x_ % P))) {}
    bool operator==(const Z &rhs) const { return x == rhs.x; }
    bool operator!=(const Z &rhs) const { return x != rhs.x; }
    Z operator-() const { return Z(x ? P - x : 0); }
    Z pow(long long k) const
    {
        Z res = 1, t = *this;
        while (k)
        {
            if (k & 1)
                res *= t;
            if (k >>= 1)
                t *= t;
        }
        return res;
    }
    Z &operator++()
    {
        x < P - 1 ? ++x : x = 0;
        return *this;
    }
    Z &operator--()
    {
        x ? --x : x = P - 1;
        return *this;
    }
    Z operator++(int)
    {
        Z ret = x;
        x < P - 1 ? ++x : x = 0;
        return ret;
    }
    Z operator--(int)
    {
        Z ret = x;
        x ? --x : x = P - 1;
        return ret;
    }
    Z inv() const { return pow(P - 2); }
    Z &operator+=(const Z &rhs)
    {
        (x += rhs.x) >= P && (x -= P);
        return *this;
    }
    Z &operator-=(const Z &rhs)
    {
        (x -= rhs.x) < 0 && (x += P);
        return *this;
    }
    Z operator-()
    {
        return -x;
    }
    Z &operator*=(const Z &rhs)
    {
        x = 1ULL * x * rhs.x % P;
        return *this;
    }
    Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                  \
    friend T operator o(const Z &lhs, const Z &rhs) \
    {                                               \
        Z res = lhs;                                \
        return res o## = rhs;                       \
    }
    setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
    
    friend istream& operator>>(istream& is, mod_int& x)
    {
        long long tmp;
        is >> tmp;
        x = tmp;
        return is;
    }
    friend ostream& operator<<(ostream& os, const mod_int& x)
    {
        os << x.val();
        return os;
    }
};

using Z = mod_int<mod>;
Z power(Z p,ll k){
    Z ans = 1;
    while(k){
        if(k % 2 == 1) ans *= p;
        p *= p;
        k /= 2;
    }
    return ans;
}
int n;
char str[5005][5005];
int G[5005][5005];

int N,vis[10005],ord[10005];
void dfs(int u){
    vis[u] = 1;
    if(u <= n){
        rep(v,1,n) if(G[u][v] && !vis[v + n]) dfs(v + n);
    }else{
        rep(v,1,n) if(!G[v][u - n] && !vis[v]) dfs(v);
    }
    ord[++N] = u;
}

int cL,cR;
void dfs2(int u,int c){
    if(u <= n) cL++;
    else cR++;
    vis[u] = c;
    if(u <= n){
        rep(v,1,n) if(!G[u][v] && !vis[v + n]) dfs2(v + n,c);
    }else{
        rep(v,1,n) if(G[v][u - n] && !vis[v]) dfs2(v,c);
    }
} 

int k;
int a[10005];
Z P[10005];
int main(){
//    freopen("test.in","r",stdin);
    scanf("%d",&n);
    P[0] = 1;
    rep(i,1,n) P[i] = P[i - 1] + P[i - 1];
    rep(i,1,n){
        scanf("%s",str[i] + 1);
        rep(j,1,n) G[i][j] = str[i][j] - '0';
    }
    rep(u,1,2 * n) if(!vis[u]) dfs(u);
    memset(vis,0,sizeof(vis));
    per(i,2 * n,1){
        if(!vis[ord[i]]){
            cL = cR = 0;
            dfs2(ord[i],ord[i]);
            if(!cR) a[++k] = 0;
            else if(!cL) a[++k] = 1;
            else a[++k] = 2;
        } 
    }
//    rep(i,1,k) printf("%d ",a[i]);
//    printf("\n");
    Z ans = 1;
    for(int l = 1,r;l <= k;l = r + 1){
        r = l;
        if(a[l] == 2){
            ans++;
            continue;
        }
        while(r < k && a[r + 1] == a[r]) r++;
        ans += P[r - l + 1] - 1;
    }
    printf("%d\n",ans.val());
	return 0; 
}