#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

mt19937 rnd(234);
const ll inf = 1e18;

const ll bts = 60;
int n;
vector<ll> r;
vector<int> s;
const ll mod = 998244353;

void summ_on_submasks(vector<ll> &a, int n) {
    for (int i = 0; i < n; i += 1) {
        for (int j = 0; j < (1 << n); j += 1) {
            if ((j >> i) & 1) {
                a[j] = (a[j] + a[j - (1 << i)]) % mod;
            }
        }
    }
}

void rev_summ_on_submasks(vector<ll> &a, int n) {
    for (int i = 0; i < n; i += 1) {
        for (int j = 0; j < (1 << n); j += 1) {
            if ((j >> i) & 1) {
                a[j] = (a[j] + mod - a[j - (1 << i)]) % mod;
            }
        }
    }
}

vector<ll> or_convolution(vector<ll> a, vector<ll> b, int n) {
    summ_on_submasks(a, n);
    summ_on_submasks(b, n);
    for (int i = 0; i < (1 << n); i += 1) {
        a[i] = (a[i] * b[i]) % mod;
    }
    rev_summ_on_submasks(a, n);
    return a;
}

ll solve() {
    vector<ll> dp(1 << n);
    dp[0] = 1;
    for (int t = 1; t <= bts; t += 1) {
        ll f = t - 1;
        ll x = 0;
        for (int i = 0; i < n; i += 1) {
            if (((r[i] >> f) & 1)) {
                x += (1 << i);
            }
        }
        ll y = (((1 << n) - 1) ^ x);
        vector<ll> a(1 << n, 0), b(1 << n, 0);
        for (int i = 0; i < (1 << n); i += 1) {
            if (s[i]) {
                b[i ^ x] = 1;
            }
        }
        for (int i = 0; i < (1 << n); i += 1) {
            a[i ^ y] = dp[i];
        }
        auto c = or_convolution(a, b, n);
        for (int i = 0; i < (1 << n); i += 1) {
            dp[i ^ y] = c[i];
        }
    }
    return dp[(1 << n) - 1];
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n;
    r.resize(n);
    for (int i = 0; i < n; i += 1) {
        cin >> r[i];
        r[i] += 1;
    }
    s.resize(1 << n);
    for (int i = 0; i < (1 << n); i += 1) {
        char c;
        cin >> c;
        s[i] = c - '0';
    }
    cout << solve() << "\n";
    return 0;
}