#include <cstdio>
const int maxm = (1 << 18) + 50, mod = 998244353;
long long c[20];
int f[maxm], g[maxm], h[maxm], n, m, b[maxm];
inline void upd(int &x, int y) { ((x += y) >= mod) && (x -= mod); }
inline void FWT(int *a, int op, int d) {
	for (int k = 1, t = 0; k < m; k <<= 1, ++t) for (int i = 0; i < m; i += (k << 1)) for (int j = 0; j < k; ++j) {
		if (c[t] & (1LL << d)) upd(a[i + j], op ? a[i + j + k] : mod - a[i + j + k]);
		else upd(a[i + j + k], op ? a[i + j] : mod - a[i + j]);
	}
}
int main() {
	scanf("%d", &n); m = (1 << n);
	for (int i = 0; i < n; ++i) scanf("%lld", &c[i]);
	for (int i = 0; i < m; ++i) scanf("%1d", &b[i]);
	h[0] = 1;
	for (int d = 0; d < 60; ++d) {
		for (int i = 0; i < m; ++i) f[i] = h[i], g[i] = b[i];
		FWT(f, 1, d); FWT(g, 1, d); for (int i = 0; i < m; ++i) f[i] = 1LL * f[i] * g[i] % mod; FWT(f, 0, d);
		for (int i = 0; i < m; ++i) h[i] = f[i];
	}
	printf("%d\n", h[0]);
	return 0;
}