#include<algorithm>
#include<cstring>
#include<cstdio>
#define ll long long
#define qwq
const int mod=998244353;
int n;
ll r[21];
int r1[21][65];
int limit[65];
int s[1<<18|1];
int dp[1<<18|1];
inline void Mod(int &x){
	if(x>=mod)x-=mod;
	if(x<0)x+=mod;
}
inline void FWT_or(int *a,int limit,int t,int S){//只对S集合做FWT 
	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];Mod(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 ;
}
int main(){
	freopen("data20.in","r",stdin);
	scanf("%d",&n);
	int Maxn=0;
	for(int i=0;i<n;++i){
		scanf("%lld",&r[i]);
		int cnt=0;
		while(r[i]){
			Maxn=std::max(Maxn,cnt);
			r1[i][cnt]=(r[i]&1);
			r[i]=r[i]>>1;
			++cnt;
		}
	}
	for(int i=n-1;i>=0;--i){
		for(int j=0;j<=Maxn;++j){
			limit[j]=(limit[j]<<1)+r1[i][j];
		}
	}
	reads();
	dp[0]=1;
	for(int i=Maxn;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];
		}
		FWT_or(f,1<<n,1,(1<<n)-1);
		FWT_or(tmp,1<<n,1,limit[i]);
		for(int j=0;j<(1<<n);++j){
			dp[j]=1ll*tmp[j]*f[j]%mod;
		}
		FWT_or(dp,1<<n,-1,limit[i]);
	}
	int ans=0;
	for(int i=0;i<(1<<n);++i){
		ans+=dp[i];Mod(ans);
	}
	printf("%d\n",ans);
	return 0;
}