#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}

template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll v):v(normS(v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll u[]={a,1,0},v[]={b,0,1};
		while(*v){
			ll t=*u/ *v;
			rep(i,3) swap(u[i]-=t*v[i],v[i]);
		}
		if(u[0]<0) rep(i,3) u[i]=-u[i];
		x=u[1],y=u[2];
		return u[0];
	}
	ModInt inv() const{
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<998244353>;

vector<bool> input(){
	string s;
	cin>>s;
	int N = s.size();
	vector<bool> x(N);
	rep(i,N) x[i] = s[i]=='1';
	return x;
}
void normalize(vector<bool>& a){
	vector<bool> b;
	int N = a.size();
	bool yet = 1;
	rep(i,N){
		if(a[i]){
			yet = 0;
		}
		if(!yet) b.pb(a[i]);
	}
	a = b;
}
vector<bool> gcd(vector<bool> a,vector<bool> b){
	normalize(a);
	normalize(b);
	int N = a.size(), M = b.size();
	if(N<M) swap(a,b),swap(N,M);

	if(M==0) return a;

	rep(i,M) a[i] = a[i] ^ b[i];
	return gcd(a,b);
}

int N;
int main(){
	cin>>N;
	vector<bool> X = input();
	vector<bool> g;
	rep(i,N){
		vector<bool> f;
		f = input();
		g = gcd(g,f);
	}
	vector<mint> p2(5000);
	p2[0] = 1;
	rep1(i,4999) p2[i] = p2[i-1]*2;

	mint ans = 0;
	vector<bool> oX = X;
	int a = X.size();
	int b = g.size();
	rep(i,a-b+1){
		if(X[i]){
			rep(j,b) X[i+j] = X[i+j] ^ g[j];
		}
		if(oX[i]){
			ans += p2[a-(i+b)];
		}
	}
	vector<bool> f(a);
	rep(i,a) f[i] = oX[i] ^ X[i];
	if(f <= oX) ans += 1;
	
	cout<<ans<<endl;
}


Measured memory_bytes: 2944