#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fi first
#define se second
const int N=5005,mod=998244353;
int n,sn,scc,c[N][N],low[N],dfn[N],st[N],bl[N],id[N],ps[N];
ll ans,pw[N];
bitset<N>e[N],E[N];
namespace BL{
    int a[N],b[N];
    void dfs(int x,int t) {
        if(x==n+1) {
            // for(int i=1;i<=n;i++)cerr<<a[i];cerr<<' '<<t<<'\n';
            return ans=(ans+pw[t])%mod,void();
        }
        for(int i=0;i<2;i++) {
            vector<int>md;bool ok=1;
            for(int j=1;j<=n;j++)if(c[x][j]!=i) {
                if(b[j]==-1)md.push_back(j),b[j]=c[x][j];
                else if(b[j]!=c[x][j]){ok=0;break;}
            }
            if(ok)a[x]=i,dfs(x+1,t-md.size());
            for(int j:md)b[j]=-1;
        }
    }
    void solve() {
        memset(b,-1,sizeof(b));
        dfs(1,n);
        cout<<ans<<'\n';
    }
}
void tj(int x) {
    st[++st[0]]=x,dfn[x]=low[x]=++sn;
    for(int i=1;i<=n;i++)if(e[x][i]) {
        if(!dfn[i])tj(i),low[x]=min(low[x],low[i]);
        else if(!bl[i])low[x]=min(low[x],dfn[i]);
    }
    if(low[x]==dfn[x]){int y;++scc;do y=st[st[0]--],bl[y]=scc;while(y!=x);}
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0);
    cin>>n,pw[0]=1;
    for(int i=1;i<=n;i++) {
        string s;cin>>s,pw[i]=pw[i-1]*2%mod;
        for(int j=0;j<n;j++)c[i][j+1]=s[j]-'0';
    }
    // BL::solve(),ans=0;
    vector<vector<int>>mp;
    vector<int>ii;
    for(int i=1;i<=n;i++) {
        vector<int>d;bitset<N>v;
        for(int j=1;j<=n;j++)d.push_back(c[j][i]),v[j]=c[j][i];
        mp.push_back(d),ii.push_back(mp.size()-1);
        for(int j=1;j<=n;j++)if(!c[j][i])e[j]|=v;
    }
    sort(ii.begin(),ii.end(),[&](int x,int y){return mp[x]<mp[y];});
    for(int i=1;i<=n;i++)if(!dfn[i])tj(i);
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(bl[i]!=bl[j]&&e[i][j])E[bl[i]][bl[j]]=1;
    iota(id+1,id+scc+1,1);
    sort(id+1,id+scc+1,[&](int x,int y){return E[x].count()>E[y].count();});
    for(int i=1;i<=scc;i++)ps[id[i]]=i;
    for(int i=0,j=0;i<mp.size();i=j) {
        int x=0,y=0;
        vector<int>&v=mp[ii[i]];
        while(j<mp.size()&&mp[ii[j]]==v)j++;
        for(int j=1;j<=n;j++) {
            if(v[j-1]&&(ps[bl[j]]<ps[x]||!x))x=bl[j];
            if(!v[j-1]&&(ps[bl[j]]>ps[y]||!y))y=bl[j];
        }
        if((!x||!y||!E[x][y])&&x!=y)ans=(ans+pw[j-i]-1)%mod;
    }
    for(int i=1,j=1;i<=scc;i=j) {
        while(j<=scc&&E[j]==E[i])j++;
        ans=(ans+pw[j-i]-1)%mod;
    }cout<<(ans+1)%mod<<'\n';
    return 0;
}