#include <bits/stdc++.h>
#define pb emplace_back
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second

using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pi;
typedef tuple<int, int, int> tu;
bool Med;

const int N = 20;
const int T = (1 << 18) + 100;
const int P = 998244353;

int n, S;
int r[T], f[T], g[T], s[T];
char c[T];

void Add(int &x, int y) { x += y, (x >= P) && (x -= P); }
void FWT(int *f, int id, int op) {
	if (op == -1) op = P - 1;
	for (int o = 2, k = 1, t = 0; o <= S + 1; o <<= 1, k <<= 1, t++)
		for (int i = 0; i <= S; i += o)
			for (int j = 0; j < k; j++)
				if ((r[t] >> id) & 1) Add(f[i + j], 1ll * f[i + j + k] * op % P);
				else Add(f[i + j + k], 1ll * f[i + j] * op % P);
}

void solve() {
	cin >> n, S = (1 << n) - 1;
	for (int i = 0; i < n; i++) cin >> r[i];
	cin >> c;
	for (int i = 0; i <= S; i++)
		s[i] = (c[i] == '1');
	f[0] = 1;
	for (int i = 0; i <= 59; i++) {
		memcpy(g, s, sizeof(int) * (S + 5));
		FWT(f, i, 1), FWT(g, i, 1);
		for (int j = 0; j <= S; j++)
			f[j] = 1ll * f[j] * g[j] % P;
		FWT(f, i, -1);
	}
	cout << f[0];
}

bool Mbe;
signed main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Med - &Mbe) / 1048576.0 << " MB\n";
	#ifdef FILE
		freopen("1.in", "r", stdin);
		freopen("1.out", "w", stdout);
	#endif
	int T = 1;
	// cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}