#include<bits/stdc++.h>
using std::cin;
using std::cout;
using std::min;
using std::max;
using std::set;
using std::queue;
using std::sort;
using std::unique;
using std::vector;
using std::pair;
#define ll long long
#define db double
#define inf 0x3f3f3f3f
#define F(i,l,r) for(int i=(l);i<=(r);i++)
#define UF(i,l,r) for(int i=(l);i>=(r);i--)
#define mp std::make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define ls(x) x<<1
#define rs(x) x<<1|1
#define pb push_back	
inline ll rd(){
	ll f=1,x=0;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
	return f*x;
}
const int mo=998244353;
inline int qk(int x){return x>=mo?x-mo:x;}
int n,Sum[(1<<18)+5],dp[61][(1<<18)+5];
ll R[18];
char vis[(1<<18)+5];
void FWT(int *a,int op,int lim){
    F(j,0,n-1)if(!(lim>>j&1))F(s,0,(1<<n)-1)if(!(s>>j&1)){
        if(op==1)a[s]=qk(a[s]+a[s^(1<<j)]);
        else a[s]=qk(a[s]-a[s^(1<<j)]+mo);
    }
}
int main(){
    n=rd();
    F(i,0,n-1)R[i]=rd();
    scanf("%s",vis);
    dp[60][(1<<n)-1]=1;
    UF(d,60,1){
        int lim=0;
        F(i,0,n-1)if(!(R[i]>>(d-1)&1))lim|=(1<<i);
        F(s,0,(1<<n)-1)Sum[s]=vis[s]-'0';
        
        F(i,0,n-1)if(lim>>i&1)F(s,0,(1<<n)-1)if(!(s>>i&1)){
            std::swap(Sum[s],Sum[s^(1<<i)]);
            Sum[s]+=Sum[s^(1<<i)];
        }
        FWT(dp[d],1,lim);FWT(Sum,1,lim);
        F(s,0,(1<<n)-1)dp[d-1][s]=1ll*dp[d][s]*Sum[s]%mo;
        FWT(dp[d-1],-1,lim);
    }
    int ans=0;
    F(i,0,(1<<n)-1)ans=qk(ans+dp[0][i]);
    cout<<ans<<"\n";
    return 0;
}