#include <bits/stdc++.h>
using namespace std;
const int maxn = (1 << 18) | 5, mod = 998244353;
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int dec(int a, int b) { return a < b ? a - b + mod : a - b; }
int mul(int a, int b) { return 1ll * a * b % mod; }
int ksm(int a, int b = mod - 2) { int ret = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) ret = mul(ret, a); return ret; }
template <typename T>
void read(T &x) {
	T sgn = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') sgn = -1;
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	x *= sgn;
}
int n;
long long R[20];
int f[maxn], g[maxn];
char s[maxn];
int main() {
	read(n); for (int i = 0; i < n; i++) read(R[i]);
	scanf("%s", s);
	int len = 1 << n;
	f[len - 1] = 1;
	for (int x = 59; ~x; x--) {
		for (int i = 0; i < len; i++) g[i] = s[i] - '0';
		for (int i = 1, p = 0; i < len; i <<= 1, p++) {
			for (int j = 0; j < len; j += i << 1) {
				for (int k = 0; k < i; k++) {
					if ((R[p] >> x) & 1) f[j + k] = add(f[j + k], f[j + k + i]);
					else swap(g[j + k], g[j + k + i]);
					g[j + k] = add(g[j + k], g[j + k + i]);
				}
			}
		}
		for (int i = 0; i < len; i++) f[i] = mul(f[i], g[i]);
		for (int i = 1, p = 0; i < len; i <<= 1, p++) {
			for (int j = 0; j < len; j += i << 1) {
				for (int k = 0; k < i; k++) {
					if ((R[p] >> x) & 1) f[j + k] = dec(f[j + k], f[j + k + i]);
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < len; i++) ans = add(ans, f[i]);
	printf("%d\n", ans);
	return 0;
}