#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<set>
#include<random>
#include<chrono>
#include<bitset>
#include<map>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#include<unordered_map>
#define eb emplace_back

using namespace std;
const int maxn=2.5e5+10, mxsz=1594323+10, inf=1e9+10, P=998244353;
const double eps=1e-10, pi=acos(-1.0);
typedef long long LL;
typedef unsigned long long ULL;
const LL INF=4e18;
typedef pair<LL, int> pli;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
typedef pair<LL, LL> pll;
inline int read() {
	int x=0, f=1; char c=getchar();
	for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
	for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
	return f?x:-x;
}inline LL readll() {
	LL x=0; int f=1; char c=getchar();
	for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
	for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
	return f?x:-x;
}
mt19937_64 rnd((unsigned)chrono::steady_clock::now().time_since_epoch().count());
inline int ksm(int x, int y) {
	int s=1;
	for(; y; y>>=1, x=1LL*x*x%P)
		if(y&1) s=1LL*s*x%P;
	return s;
}
inline int add(int x, int y) {x+=y; return x>=P?x-P:x;}
inline int del(int x, int y) {x-=y; return x<0?x+P:x;}
inline int abs_(int x) {return x>0?x:-x;}
int gcd(int x, int y) {return y?gcd(y, x%y):x;}

LL p[60];
int S[1<<18], g[1<<18];
char s[(1<<18)+10];
int n;

int f[1<<18];
int main() {
	n=read();
	for(int i=1; i<=n; ++i) {
		LL x=readll();
		for(int j=0; j<60; ++j)
			p[j]^=(x>>j&1)<<(i-1);
	}
	scanf("%s", s+1);
	for(int i=0; i<(1<<n); ++i) S[i]=s[i+1]-'0';

//	for(int i=0; i<60; ++i) printf("%d ", p[i]); puts("");
	f[(1<<n)-1]=1;
	for(int k=59; k>=0; --k) {
		for(int i=0; i<n; ++i) if(p[k]>>i&1) {
			for(int j=0; j<(1<<n); ++j)
				if(j>>i&1) f[j^(1<<i)]=add(f[j^(1<<i)], f[j]);
		} 
		for(int i=0; i<(1<<n); ++i) g[i]=S[i];
		for(int i=0; i<n; ++i) if(p[k]>>i&1) {
			for(int j=0; j<(1<<n); ++j)
				if(j>>i&1) g[j^(1<<i)]=add(g[j^(1<<i)], g[j]);
		} else {
			for(int j=0; j<(1<<n); ++j)
				if(j>>i&1) swap(g[j^(1<<i)], g[j]), g[j^(1<<i)]=add(g[j^(1<<i)], g[j]);
		}
		for(int i=0; i<(1<<n); ++i) f[i]=1ll*f[i]*g[i]%P;
		for(int i=0; i<n; ++i) if(p[k]>>i&1) {
			for(int j=0; j<(1<<n); ++j)
				if(j>>i&1) f[j^(1<<i)]=del(f[j^(1<<i)], f[j]);
		}
	//	printf("k=%d\n", k);
	//	for(int i=0; i<(1<<n); ++i)
	//		printf("%d ", f[i]);
	//	puts("");
	}
	int ans=0;
	for(int i=0; i<(1<<n); ++i) ans=add(ans, f[i]);
	printf("%d", ans);
	return 0;
}