#include<bits/stdc++.h>
using namespace std;
#define int long long
#define md(a) a=(a%mod+mod)%mod
#define file(a) freopen(#a".in","r",stdin);freopen(#a".out","w",stdout)

bool ST;

const int N=19,M=262150,mod=998244353;
int n,S,a[N],To[N],b[M],B[M],rec[M],bak[M],p,dp[M],tmp[M],F[M],G[M],Len;
int f[M],las[M],nxt[M];inline void add(int &x,int y){x+=y;if(x>=mod)x-=mod;}
struct num{int a,id;}val[N];inline bool cmp(num a,num b){return a.a>b.a||(a.a==b.a&&a.id<b.id);}

int AND[2][2][2]={{0,1,1,1},{mod-1,1,1,0}};
inline void FWT(int *A,int f[2][2])
{
	for(int s=2;s<=Len;s<<=1)for(int i=0;i<Len;i+=s)for(int j=0;j<s/2;j++)
	{
		int u=A[i+j],t=A[i+j+s/2];
		A[i+j]=(f[0][0]*u%mod+f[0][1]*t%mod)%mod;
		A[i+j+s/2]=(f[1][0]*u%mod+f[1][1]*t%mod)%mod;
	}
}

inline void DP(int bit)
{
	for(int i=0;i<n;i++)val[i]={(a[i]>>bit)&1,i};sort(val,val+n,cmp);for(int i=0;i<n;i++)To[val[i].id]=i;
	for(int i=1;i<S;i++){rec[i]=rec[i^(i&-i)]|(1<<To[__builtin_ctz(i)]);bak[rec[i]]=i;}
	for(int i=0;i<S;i++)las[rec[i]]=f[i],b[rec[i]]=B[i];p=0;while(p<n&&val[p].a)p++;for(int i=0;i<S;i++)dp[i]=b[i];
	for(int t=p;t<n;t++)
	{
		for(int i=0;i<S;i++)tmp[i]=dp[i],dp[i]=0;
		for(int i=0;i<S;i++)if(tmp[i])
		{
			if((i>>t)&1)add(dp[i^(1<<t)],tmp[i]);
			else add(dp[i^(1<<t)],tmp[i]),add(dp[i],tmp[i]);
		}
	}
	int Blok=(1<<(n-p));Len=(1<<p);
	for(int bl=0;bl<Blok;bl++)
	{
		int L=bl*Len,R=L+Len;
		for(int i=L;i<R;i++)F[i-L]=las[i];for(int i=0;i<Len;i++)G[i]=dp[i^(bl<<p)];
		FWT(F,AND[0]),FWT(G,AND[0]);for(int i=0;i<Len;i++)F[i]=F[i]*G[i]%mod;FWT(F,AND[1]);
		for(int i=0;i<Len;i++)nxt[i+L]=F[i];
	}
	for(int i=0;i<S;i++)f[bak[i]]=nxt[i],nxt[i]=0;
}

bool ED;

signed main()
{
	cerr<<(&ST-&ED)/1024.0/1024<<endl;ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	file(integer3);
	cin>>n;S=(1ll<<n);for(int i=0;i<n;i++)cin>>a[i];for(int i=0;i<S;i++){char c;cin>>c;B[i]=(c-'0');}
	f[S-1]=1;for(int i=59;i>=0;i--)DP(i);int ans=0;for(int i=0;i<S;i++)add(ans,f[i]);cout<<ans<<'\n';
}