#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
// #define ATC
#define LL long long
#define eb emplace_back
#define FIO(FILENAME) freopen(FILENAME".in", "r", stdin), freopen(FILENAME".out", "w", stdout)
using namespace std;

#ifdef ATC
#include <atcoder/all>
using namespace atcoder;
#endif

const int N = 20, M = (1 << 18) + 9, mod = 998244353;
int n, st[M], f[M], g[M], h[M], id[N], pos[N], mp[M];
LL r[N];
char ss[M];

template<typename T>
inline T fix (T x) { x %= mod; return x < 0 ? x + mod : x; }
template<typename T, typename _T>
inline void inc (T &x, const _T &y) { x += y; x >= mod && (x -= mod); }
template<typename T, typename _T>
inline void dec (T &x, const _T &y) { x -= y; x < 0 && (x += mod); }

inline void FWT (auto A, bool o = 0) {
    for (int i = 1; i < (1 << n); i <<= 1) 
        for (int j = 0, p = i << 1; j < (1 << n); j += p) 
            for (int k = j; k < j + i; k++) 
                o ? dec(A[k + i], A[k]) : inc(A[k + i], A[k]);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) cin >> r[i];
    cin >> ss;
    for (int i = 0; i < (1 << n); i++) st[i] = ss[i] == '1';
    iota(id, id + n, 0);
    h[0] = 1;
    for (int i = 0; i < 60; i++) {
        sort(id, id + n, [&](int x, int y) {
            return (r[x] >> i & 1) < (r[y] >> i & 1);
        });
        for (int j = 0; j < n; j++) pos[id[j]] = j;
        for (int j = 0; j < (1 << n); j++) {
            int s = 0;
            for (int k = 0; k < n; k++) {
                if (j >> k & 1) {
                    s |= (!(r[k] >> i & 1)) << pos[k];
                } else {
                    s |= (r[k] >> i & 1) << pos[k];
                }
            }
            f[s] = h[j];
            g[s] = st[j];
            mp[j] = s;
        }
        FWT(f), FWT(g);
        for (int j = 0; j < (1 << n); j++) f[j] = (LL)f[j] * g[j] % mod;
        FWT(f, 1);
        for (int j = 0; j < (1 << n); j++) h[j] = f[mp[j]];
    }
    cout << h[0];
    cerr << 1. * clock() / CLOCKS_PER_SEC << endl;
}
// I love WHQ!