#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int MOD = 998244353, L = 60;

void add(int &x, int y) {
    if ((x += y) >= MOD) {
        x -= MOD;
    }
}

int dp[1 << 18], A[1 << 18], B[1 << 18], n, s[1 << 18], N;


void orConvolution() {
    for (int i = 0; i < n; ++i) {
        for (int mask = 0; mask < N; ++mask) {
            if (mask >> i & 1) {
                add(A[mask], A[mask ^ 1 << i]);
                add(B[mask], B[mask ^ 1 << i]);
            }
        }
    }

    for (int i = 0; i < N; ++i) {
        A[i] = 1LL * A[i] * B[i] % MOD;
    }

    for (int i = 0; i < n; ++i) {
        for (int mask = 0; mask < N; ++mask) {
            if (mask >> i & 1) {
                add(A[mask],  MOD - A[mask ^ 1 << i]);
            }
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n;
    N = 1 << n;

    vector<ll> a(n);

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    string str;
    cin >> str;

    for (int i = 0; i < N; ++i) {
        s[i] = str[i] - '0';
    }

    dp[0] = 1;

    for (int b = 0; b < L; ++b) {
        int shift = 0;
        for (int i = 0; i < n; ++i) {
            if (a[i] >> b & 1) {
                shift ^= 1 << i;
            }
        }

        for (int mask = 0; mask < N; ++mask) {
            A[mask ^ shift] = dp[mask];
            B[mask ^ shift] = s[mask];
        }

        orConvolution();

        for (int mask = 0; mask < N; ++mask) {
            dp[mask ^ shift] = A[mask];
        }
    }

    cout << dp[0] << '\n';

    return 0;
}