#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}
template<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}

using ll = long long;
using R = long double;
const R EPS = 1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r) {return (r > EPS) - (r < -EPS);}
inline R sq(R x) {return sqrt(max(x, 0.0L));}

const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};

// Problem Specific Parameter:
const int limit = 4010;
using T = bitset<limit>;

T gcd(T a, T b) {
	if (b.none()) return a;
	int ta = 0, tb = 0;
	rep(i, limit) if (a[i]) ta = i;
	rep(i, limit) if (b[i]) tb = i;

	if (ta < tb) {
		return gcd(b, a);
	} else {
		T ab = a;
		for (int i = ta; i >= tb; --i) {
			if (ab[i]) {
				ab ^= b << (i - tb);
			}
		}
		return gcd(b, ab);
	}
	return b;
}

T read() {
	string s;
	cin >> s;
	const int n = s.size();
	T ret;
	ret.reset();
	rep(i, n) if (s[i] == '1') ret.set(n - 1 - i);
	return ret;
}

const ll mod = 998244353LL;

int main(void) {
	int n;
	cin >> n;

	T x, a[6];

	x = read();
	rep(i, n) a[i] = read();

	T g = a[0];
	rep(i, 1, n) g = gcd(g, a[i]);

	int tg = 0, tx = 0;
	rep(i, limit) if (g[i]) tg = i;
	rep(i, limit) if (x[i]) tx = i;

	ll ans = 0LL;
	for (int i = tx; i >= tg; --i) ans = (2LL * ans + x[i]) % mod;
	ans = (ans + 1) % mod;

	T y;
	y.reset();

	for (int i = tx; i >= tg; --i) {
		if (x[i] != y[i]) {
			y ^= g << (i - tg);
		}
	}

	bool big = false;
	rrep(i, tg) {
		if (x[i] != y[i]) {
			if (x[i] < y[i]) big = true;
			break;
		}
	}

	if (big) ans = (ans + mod - 1) % mod;
	cout << ans << endl;
	return 0;
}