#include<iostream>
#include<cstdio>
#define M 60
#define N 18
#define mod 998244353
using namespace std;
long long read()
{
    char c=0;
    long long sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
inline void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
inline void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
long long R[1<<N];
int n,S[1<<N],F[M+1][1<<N],G[1<<N],dp[M+1][1<<N],ans;
string s;
bool used[1<<N];
int main()
{
    n=read();
    for (int i=0;i<n;++i)
    {
	R[i]=read();
	for (int j=0;j<=59;++j)
	    if (R[i]&(1ll<<j))
		S[j]|=(1<<i);
    }
    cin>>s;
    for (int i=0;i<(1<<n);++i) used[i]=s[i]-'0';
    for (int i=0;i<=59;++i)
    {
	for (int j=0;j<(1<<n);++j)
	    if (used[j])
		F[i][j^S[i]^((1<<n)-1)]++;
	for (int j=0;j<n;++j)
	    for (int k=0;k<(1<<n);++k)
		if (!(k&(1<<j)))
		    Adder(F[i][k],F[i][k|(1<<j)]);
    }
    dp[60][(1<<n)-1]=1;
    for (int i=59;i>=0;--i)
    {
	for (int j=0;j<(1<<n);++j) G[j]=dp[i+1][j];
	for (int j=0;j<n;++j)
	    if (R[j]&(1ll<<i))
		for (int k=0;k<(1<<n);++k)
		    if (!(k&(1<<j)))
			Adder(G[k],G[k|(1<<j)]);
	for (int j=0;j<(1<<n);++j) G[j]=1ll*G[j]*F[i][j]%mod;
	for (int j=0;j<n;++j)
	    if (R[j]&(1ll<<i))
		for (int k=0;k<(1<<n);++k)
		    if (!(k&(1<<j)))
			Adder2(G[k],-G[k|(1<<j)]);
	for (int j=0;j<(1<<n);++j) dp[i][j]=G[j];
    }
    for (int i=0;i<(1<<n);++i) Adder(ans,dp[0][i]);
    printf("%d\n",ans);
    return 0;
}