#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;
    }
}

vector<int> orConvolution(int n, vector<int> A, vector<int> B) {
    for (int i = 0; i < n; ++i) {
        for (int mask = 0; mask < (1 << 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 < (1 << n); ++i) {
        A[i] = 1LL * A[i] * B[i] % MOD;
        if (__builtin_parity(i)) {
            A[i] = MOD - A[i];
        }
    }

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

    for (int i = 0; i < (1 << n); ++i) {
        if (__builtin_parity(i)) {
            A[i] = MOD - A[i];
        }
        if (A[i] >= MOD) {
            A[i] -= MOD;
        }
    }

    return A;
}

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

    int n;
    cin >> n;

    const int N = 1 << n;

    vector<ll> a(n);
    vector<int> s(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';
    }

    vector<int> dp(N);
    dp[0] = 1;

    for (int b = 0; b < L; ++b) {
        vector<int> A(N), B(N);

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

            m = 0;
            for (int i = 0; i < n; ++i) {
                if ((a[i] >> b & 1) != (mask >> i & 1)) {
                    m |= 1 << i;
                }
            }
            add(B[m], s[mask]);
        }

        auto R = orConvolution(n, A, B);

        for (int mask = 0; mask < N; ++mask) {
            int m = mask;
            for (int i = 0; i < n; ++i) {
                if (a[i] >> b & 1) {
                    m ^= 1 << i;
                }
            }
            dp[mask] = R[m];
        }
    }

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

    return 0;
}