#include<bits/stdc++.h>
#define int long long//淇′话
//#define ll long long
#define pii pair <int,int>
#define lowbit(x) (-x&x)
#define lson (p<<1)
#define rson (p<<1|1)
using namespace std;
#define read() (red<int>())
template<typename T>inline T red(){T x=0;bool f=false;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=true;c=getchar();}while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();return f?-x:x;}
template<typename T>inline void write(T x){if(x<0){putchar('-');x=-x;}if(x/10)write(x/10);putchar((x%10)^48);return;}
const int mod=998244353;
int n;
int r[21];
int r1[21][65];
int limit[65];
int s[1<<19|1];
int dp[1<<19|1];
inline void yj(int &x){
	if(x>=mod)x-=mod;
	if(x<0)x+=mod;
}
inline void js(int *a,int limit,int t,int S){
	for(int mid=1;mid<limit;mid=mid<<1){
		int n=mid<<1;
		if(!(S&mid))continue;
		for(int i=0;i<limit;i+=n){
			for(int k=0;k<mid;++k){
				a[i+k+mid]+=t*a[i+k];yj(a[i+k+mid]);
			}
		}
	}
	return ;
}
int tmp[1<<19|7];
int f[1<<19|7];
inline void reads(){
	char c=getchar();
	int len=0;
	for(;c<'0'||c>'1';c=getchar());
	for(;c<='1'&&c>='0';c=getchar())s[len++]=c-'0';
	return ;
}
signed main(){
//	freopen("integer3.in","r",stdin);
//	freopen("integer.out","w",stdout);
	n=read();
	int maxn=0;
	for(int i=0;i<n;++i){
		cin>>r[i];
		maxn=max(maxn,r[i]);
		int cnt=0;
		while(r[i]){
			r1[i][cnt]=(r[i]&1);
			r[i]=r[i]>>1;
			++cnt;
		}
	}
	if(n>13&&maxn>3)return 0;
	for(int i=n-1;i>=0;--i){
		for(int j=0;j<=60;++j){
			limit[j]=(limit[j]<<1)+r1[i][j];
		}
	}
	reads();
	dp[0]=1;
	for(int i=60;i>=0;--i){
		for(int j=0;j<(1<<n);++j)tmp[j]=dp[j],f[j]=0;
		for(int j=0;j<(1<<n);++j){
			int S=j;
			for(int k=0;k<n;++k){
				if(limit[i]&(1<<k)){
					S^=(1<<k);
				}
			}
			if(s[j]==1)++f[S];
		}
		js(f,1<<n,1,(1<<n)-1);
		js(tmp,1<<n,1,limit[i]);
		for(int j=0;j<(1<<n);++j){
			tmp[j]=1ll*tmp[j]*f[j]%mod;
		}
		js(tmp,1<<n,-1,limit[i]);
		for(int j=0;j<(1<<n);++j){
			dp[j]=tmp[j];
		}
	}
	int ans=0;
	for(int i=0;i<(1<<n);++i){
		ans+=dp[i];
		yj(ans);
	}
	cout<<ans<<endl;
	return 0;
}