//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si inline
#define fi first
#define se second
using namespace std;
typedef long long ll;typedef __int128 li;typedef long double ld;typedef unsigned long long ull;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=INT_MAX;cl linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{
	
	ci N=5005,mod=998244353;

	int n,a[N][N];
	int cnt[N];

	ci M=80;
	struct Bit{
		ull v[M];
		si Bit(){memset(v,0,sizeof v);}
		si Bit Flip()const{
			Bit tmp;
			for(int i=0;i<M;i++)tmp.v[i]=~v[i];
			return tmp;
		}
		si void Set(int pos){
			v[pos>>6]|=(1ll<<(pos&63));
		}
		si int Val(int pos)const{
			return (v[pos>>6]>>(pos&63))&1;
		}
		si Bit operator & (const Bit &obj)const{
			Bit res;
			for(int i=0;i<M;i++)res.v[i]=v[i]&obj.v[i];
			return res;
		}
		si Bit operator | (const Bit &obj)const{
			Bit res;
			for(int i=0;i<M;i++)res.v[i]=v[i]|obj.v[i];
			return res;
		}
		si Bit operator ^ (const Bit &obj)const{
			Bit res;
			for(int i=0;i<M;i++)res.v[i]=v[i]^obj.v[i];
			return res;
		}
		si bool operator < (const Bit &obj)const{
			for(int i=0;i<M;i++){
				if(v[i]<obj.v[i])return true;
				if(v[i]>obj.v[i])return false;
			}
			return false;
		}
		si bool operator == (const Bit &obj)const{
			for(int i=0;i<M;i++)if(v[i]!=obj.v[i])return false;
			return true;
		}
	};
	
	struct T{
		Bit lock,val;
		si bool operator < (const T &obj)const{
			if(lock==obj.lock)return val<obj.val;
			return lock<obj.lock;
		}
	};

	map<T,int> f[2];

	void mian(){
		cin>>n;
		for(int i=1;i<=n;i++){
			string s;cin>>s;
			for(int j=1;j<=n;j++)a[i][j]=s[j-1]-'0',cnt[i]+=a[i][j];
		}
		
		vector<int> pos(n);
		iota(pos.begin(),pos.end(),1);
		sort(pos.begin(),pos.end(),[&](int x,int y){return cnt[x]>cnt[y];});

		T tmp;
		f[0][tmp]=1;
		int now=0,nxt=1;
		for(int i:pos){
			f[nxt].clear();
			for(int c=0;c<2;c++){
				Bit pos;
				for(int j=1;j<=n;j++)if(a[i][j]!=c)pos.Set(j);
				for(auto &v:f[now]){
					if(c==0){
						Bit nlk=(v.fi.lock.Flip()|v.fi.val);
						if((nlk&pos)==pos){
							tmp.lock=v.fi.lock|pos;
							tmp.val=v.fi.val|pos;
							(f[nxt][tmp]+=v.se)%=mod;
						}
					}
					else{
						Bit nlk=(v.fi.lock.Flip()|(v.fi.lock^v.fi.val));
						if((nlk&pos)==pos){
							tmp.lock=v.fi.lock|pos;
							tmp.val=v.fi.val;
							(f[nxt][tmp]+=v.se)%=mod;
						}
					}
				}
			}
			swap(now,nxt);
		}

		int ans=0;
		for(auto &v:f[now]){
			int res=v.se;
			for(int j=1;j<=n;j++)if(!v.fi.lock.Val(j))res=(res+res)%mod;
			(ans+=res)%=mod;
		}

		cout<<ans<<endl;
	}
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}