#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 998244353;
const int N = 20;
const int M = 1 << 18;

char s[M];
ll r[N];
int b[M], f[M], g[M], h[M];
int n, m;

void inc(int &a, int b) { a = a >= mod - b ? a - mod + b : a + b; }
void dec(int &a, int b) { a = a >= b ? a - b : a + mod - b; }
int mul(int a, int b) { return 1ll * a * b % mod; }
void fwt(int *f, int d, int op) {
    for(int i = 2, t = 0; i <= m; ++ t, i <<= 1)
        for(int j = 0, p = i >> 1; j < m; j += i)
            for(int k = 0; k < p; ++ k)
                (r[t] >> d & 1) ? 
                    (op == 1 ? inc(f[j + k], f[j + k + p]) : dec(f[j + k], f[j + k + p])) :
                    (op == 1 ? inc(f[j + k + p], f[j + k]) : dec(f[j + k + p], f[j + k])) ;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n, m = 1 << n;
    for(int i = 0; i < n; ++ i)
        cin >> r[i];
    cin >> s;
    for(int i = 0; i < m; ++ i)
        b[i] = (s[i] == '1');
    
    f[0] = 1;
    for(int i = 0; i < 60; ++ i) {
        for(int j = 0; j < m; ++ j) g[j] = f[j], h[j] = b[j];
        fwt(g, i, 1), fwt(h, i, 1);
        for(int j = 0; j < m; ++ j) g[j] = mul(g[j], h[j]);
        fwt(g, i, -1);
        for(int j = 0; j < m; ++ j) f[j] = g[j];
    }

    cout << f[0] << '\n';
    return 0;
}