// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
const int MOD = 998244353;
struct mint
{
    unsigned v;
    mint(unsigned v_ = 0) : v(v_) {}
    mint operator-() const { return v ? MOD - v : *this; }
    mint &operator+=(const mint &X) { return (v += X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator-=(const mint &X) { return (v += MOD - X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator*=(const mint &X) { return v = 1llu * v * X.v % MOD, *this; }
    mint &operator/=(const mint &X) { return *this *= X.inv(); }
    mint pow(long long B) const
    {
        B %= MOD - 1;
        if (B < 0)
            B += MOD - 1;
        mint res = 1, A = *this;
        while (B)
        {
            if (B & 1)
                res *= A;
            B >>= 1;
            A *= A;
        }
        return res;
    }
    mint inv() const { return pow(MOD - 2); }
    friend mint operator+(const mint &A, const mint &B) { return mint(A) += B; }
    friend mint operator-(const mint &A, const mint &B) { return mint(A) -= B; }
    friend mint operator*(const mint &A, const mint &B) { return mint(A) *= B; }
    friend mint operator/(const mint &A, const mint &B) { return mint(A) /= B; }
    friend std::istream &operator>>(std::istream &A, mint &B) { return A >> B.v; }
    friend std::ostream &operator<<(std::ostream &A, const mint &B) { return A << B.v; }
    explicit operator bool() const { return v; }
} dp[1 << 18], c[1 << 18];
int n, cur;
long long r[1 << 18];
char C;
void solve(mint *x, mint *y, mint *z, int dep)
{
    if (!~--dep)
        return void(*z = *x * *y);
    if (cur >> dep & 1)
    {
        for (int i = 0; i != 1 << dep; ++i)
            x[i] += x[i | 1 << dep];
        for (int i = 0; i != 1 << dep; ++i)
            y[i] += y[i | 1 << dep];
        solve(x, y, z, dep);
        solve(x + (1 << dep), y + (1 << dep), z + (1 << dep), dep);
        for (int i = 0; i != 1 << dep; ++i)
            z[i] -= z[i | 1 << dep];
    }
    else
    {
        for (int i = 0; i != 1 << dep; ++i)
            x[i | 1 << dep] += x[i];
        for (int i = 0; i != 1 << dep; ++i)
            y[i | 1 << dep] += y[i];
        solve(x, y, z, dep);
        solve(x + (1 << dep), y + (1 << dep), z + (1 << dep), dep);
        for (int i = 0; i != 1 << dep; ++i)
            z[i | 1 << dep] -= z[i];
    }
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n;
    for (int i = 0; i != n; ++i)
        std::cin >> r[i];
    for (int i = 0; i != 1 << n; ++i)
        std::cin >> C, c[i] = C == '1';
    dp[0] = 1;
    for (int i = 0; i != 60; ++i)
    {
        cur = 0;
        for (int j = 0; j != n; ++j)
            cur |= (r[j] >> i & 1) << j;
        mint x[1 << n], y[1 << n];
        std::copy(dp, dp + (1 << n), x);
        std::copy(c, c + (1 << n), y);
        solve(x, y, dp, n);
    }
    std::cout << dp[0] << std::endl;
    return 0;
}