#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define inf 1e9
#define pii pair <int, int>
const int mod = 998244353;
int read () {
	int x = 0, f = 1;
	char ch = getchar ();
	while (ch < '0' || ch > '9') {
		if (ch == '-') f = -1;
		ch = getchar ();
	}
	while (ch >= '0' && ch <= '9') {
		x = x * 10 + ch - '0';
		ch = getchar ();
	}
	return x * f;
}
void write (int x) {
	if (x < 0) x = -x, putchar ('-');
	if (x >= 10) write (x / 10);
	putchar (x % 10 + '0');
}
int quickmod (int x, int y) {
	int Ans = 1;
	while (y) {
		if (y & 1) Ans = (Ans * x) % mod;
		x = (x * x) % mod;
		y >>= 1;
	}
	return Ans;
}
inline void Add(int &x, int y) {
    x += y;
    if(x >= mod) x -= mod;
}
inline void Dec(int &x, int y) {
    x -= y;
    if(x < 0) x += mod;
}
int n;
int a[105];
char ch[1000005];
int f[(1<<18)+5], g[(1<<18)+5];
signed main () {
//	freopen (".in", "r", stdin);
//	freopen (".out", "w", stdout);
	n = read();
    for(int i = 1; i <= n; i++) a[i] = read();
    scanf("%s", ch);
    f[0] = 1;
    for(int i = 0; i <= 60; i++) {
        int s = 0;
        for(int j = 1; j <= n; j++) s |= ((a[j] >> i & 1) << (j - 1));
        for(int j = 0; j < (1 << n); j++) g[j] = ch[j] - '0';
        for(int j = 0; j < n; j++) for(int S = 0; S < (1 << n); S++) if((s ^ S) >> j & 1) Add(f[S], f[S ^ (1 << j)]), Add(g[S], g[S ^ (1 << j)]);
        for(int S = 0; S < (1 << n); S++) f[S] = (f[S] * g[S]) % mod;
        for(int j = 0; j < n; j++) for(int S = 0; S < (1 << n); S++) if((s ^ S) >> j & 1) Dec(f[S], f[S ^ (1 << j)]);
    }
    write(f[0]), putchar('\n');
	return 0;
}
/*
*/