#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 998244353
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

vector<int> _sub(const vector<int>& a, const vector<int>& b)
{
    int n = (int)a.size(), m = (int)b.size();
    assert(n >= m);
    vector<int> res;
    for(int i = 0; i < n - m; ++i) res.push_back(a[i]);
    for(int i = 0; i < m; ++i){
        if((a[i + n - m] ^ b[i]) == 1 || !res.empty()) res.push_back(a[i + n - m] ^ b[i]);
    }
    return res;
}

// 余りを返す
vector<int> _div(const vector<int>& a, const vector<int>& b)
{
    int n = (int)a.size(), m = (int)b.size();
    vector<int> rem;
    for(int i = 0; i < n; ++i){
        if(a[i] == 1 || !rem.empty()) rem.push_back(a[i]);
        if((int)rem.size() < m) continue;
        rem = _sub(rem, b);
    }
    return rem;
}

vector<int> _gcd(const vector<int>& a, const vector<int>& b)
{
    int n = (int)a.size(), m = (int)b.size();
    if(m == 0) return a;
    return (n >= m) ? _gcd(b, _div(a, b)) : _gcd(b, a);
}

int two[4005];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    string s;
    cin >> s;
    vi x;
    rep(i,(int)s.size()) x.pb((s[i] == '1'));
    vvi a(n);
    rep(i,n){
        string s;
        cin >> s;
        rep(j,(int)s.size()){
            a[i].pb((s[j] == '1'));
        }
    }
    vi g = a[0];
    rep(i,n-1){
        g = _gcd(g, a[i+1]);
    }
    int p = (int)x.size(), q = (int)g.size();
    if(p < q){
        cout << "1\n";
        return 0;
    }
    two[0] = 1;
    rep(i,4004){
        two[i+1] = two[i] * 2 % MOD;
    }
    vi _x = x;
    srep(i,p-q+1,p) _x[i] = 0;
    vi rem = _div(_x, g);
    int ans = 0;
    for(int i = 0; i < p - q + 1; ++i){
        if(x[i]) ans = (ans + two[p-q-i]) % MOD;
    }
    bool add = true;
    int r = q - 1 - (int)rem.size();
    rep(i,q-1){
        if(i < r){
            if(x[p-q+1+i]) break;
        }else{
            if(rem[i-r] > x[p-q+1+i]){
                add = false;
                break;
            }else if(rem[i-r] < x[p-q+1+i]){
                break;
            }
        }
    }
    cout << (ans + add) % MOD << "\n";
    return 0;
}


Measured memory_bytes: 21248