#include<bits/stdc++.h>
#define IL inline
#define reg register
#define ll long long
#define N 22
#define M (1<<18|5)
#define mod 998244353
IL ll read()
{
    reg ll x=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return x;
}

IL int Add(reg int x,reg int y){return x+y<mod?x+y:x+y-mod;}
IL int Sub(reg int x,reg int y){return x<y?x-y+mod:x-y;}
IL void Pls(reg int &x,reg int y){x=Add(x,y);}
IL void Dec(reg int &x,reg int y){x=Sub(x,y);}
IL int Mul(reg int x,reg int y){reg ll r=1ll*x*y; return r<mod?r:r%mod;}

int n,full;
ll a[N];
bool vis[M];

IL void FMT(reg int *f){for(reg int i=1,s;i<full;i<<=1)for(s=i;s<full;s=(s+1)|i)Pls(f[s],f[s^i]);}
IL void IFMT(reg int *f){for(reg int i=1,s;i<full;i<<=1)for(s=i;s<full;s=(s+1)|i)Dec(f[s],f[s^i]);}

int f[M],g[M];

main()
{
    n=read(),full=1<<n;
    for(reg int i=0;i<n;++i)a[i]=read();
    static char s[M]; scanf("%s",s);
    for(reg int i=full;i--;)vis[i]=s[i]=='1';
    f[full-1]=1;
    for(reg int o=0,s,i;o<60;++o)
    {
        static int x[N],d[M];
        reg int turn=0;
        for(i=n;i--;)
        {
            x[i]=a[i]>>o&1;
            if(!x[i])turn|=1<<i;
        }
        for(s=full;s--;)d[s]=f[s^turn];
        memcpy(f,d,full<<2);
        for(s=full;s--;)g[s]=vis[(full-1)^s^turn];
        FMT(f),FMT(g);
        for(s=full;s--;)g[s]=Mul(f[s],g[s]);
        IFMT(g);
        for(s=full;s--;)f[s]=g[s^turn];
    }
    printf("%d\n",f[full-1]);
}