#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
#define fi first
#define se second
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using LL=__int128;
using namespace std;const int N=18+5,M=(1<<18)+5,K=600,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
int n,m,k,x,y,z;ll R[N],L[60],f[M],g[M];char s[M];
void AND(ll *A,int k,int p,int op){
	for(int i=2;i<=k;i<<=1)if(p&(i/2)){
		for(int j=0;j<k;j+=i) for(int h=j;h<j+i/2;h++) A[h]+=A[h+i/2]*op+mod;
	}
	for(int i=0;i<k;i++) A[i]%=mod;
}
int main(){
	int i,j,h;scanf("%d",&n);k=(1<<n);
	for(i=0;i<n;i++) scanf("%lld",&R[i]);
	scanf("%s",s);for(i=0;i<k;i++) s[i]-='0';
	f[k-1]=1;for(i=59;~i;i--){
		for(j=0;j<n;j++) L[i]|=(R[j]>>i&1)<<j;
		Me(g,0);for(j=0;j<k;j++) g[(j&L[i])|((~j)&(k-1-L[i]))]+=s[j];
		AND(g,k,k-1,1);AND(f,k,L[i],1);for(j=0;j<k;j++) f[j]=f[j]*g[j]%mod;AND(f,k,L[i],-1);
	}
	ll Sum=0;for(i=0;i<k;i++) Sum+=f[i];
	printf("%lld\n",Sum%mod);
}