#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


constexpr int E = 60;

int N;
vector<Int> R;
char S[(1 << 18) + 1];


namespace brute {
Mint dp[2][1 << 11][1 << 11];
Mint run() {
  memset(dp, 0, sizeof(dp));
  auto crt = dp[0], nxt = dp[1];
  crt[0][0] = 1;
  for (int e = E; --e >= 0; ) {
    for (int i = 0; i < N; ++i) {
      const int r = R[i] >> e & 1;
      for (int p = 0; p < 1 << (i + 1); ++p) {
        fill(nxt[p], nxt[p] + (1 << N), 0);
      }
      for (int p = 0; p < 1 << i; ++p) for (int q = 0; q < 1 << N; ++q) {
        nxt[p][q | r << i] += crt[p][q];
        if ((q & 1 << i) || r) {
          nxt[p | 1 << i][q] += crt[p][q];
        }
      }
      swap(crt, nxt);
    }
    fill(nxt[0], nxt[0] + (1 << N), 0);
    for (int p = 0; p < 1 << N; ++p) if (S[p] == '1') {
      for (int q = 0; q < 1 << N; ++q) {
        nxt[0][q] += crt[p][q];
      }
    }
    swap(crt, nxt);
  }
  Mint ans = 0;
  for (int q = 0; q < 1 << N; ++q) {
    ans += crt[0][q];
  }
  return ans;
}
}  // brute


namespace slow {
Mint run() {
  vector<int> thr(N + 1);
  thr[0] = 1;
  for (int i = 1; i <= N; ++i) {
    thr[i] = thr[i - 1] * 3;
  }
  vector<int> tr(1 << N, 0);
  for (int i = 0; i < N; ++i) {
    for (int p = 0; p < 1 << i; ++p) {
      tr[p | 1 << i] = tr[p] + thr[i];
    }
  }
  // 0,1 -> 0,1,*
  vector<int> fs(thr[N], 0);
  for (int p = 0; p < 1 << N; ++p) {
    fs[tr[p]] += (S[p] - '0');
  }
  for (int i = 0; i < N; ++i) {
    for (int t = 0; t < thr[N]; ++t) {
      const int a = t / thr[i] % 3;
      if (a < 2) {
        fs[t + (2 - a) * thr[i]] += fs[t];
      }
    }
  }
// cerr<<"fs = "<<fs<<endl;
  const int mask = (1 << N) - 1;
  vector<Mint> crt(1 << N);
  crt[0] = 1;
  for (int e = E; --e >= 0; ) {
    int r = 0;
    for (int i = 0; i < N; ++i) {
      r |= (R[i] >> e & 1) << i;
    }
    vector<Mint> nxt(1 << N);
    for (int qq = 0; qq < 1 << N; ++qq) {
      for (int q = qq; ; --q &= qq) {
        /*
          q' - q \subseteq r
          
          r q q'  p
          ---------
          0 0 0   0
          0 0 1
          0 1 1   *
          1 0 0   1
          1 0 1   0
          1 1 1   *
        */
        if (!((qq - q) & ~r)) {
          const int mask0 = ((~r & ~qq) | (r & (qq - q))) & mask;
          const int mask1 = (r & ~qq) & mask;
          const int mask2 = mask - mask0 - mask1;
          const int t = tr[mask1] + 2 * tr[mask2];
// if(N<=2&&e<3)cerr<<e<<" "<<r<<" "<<q<<" "<<qq<<": "<<fs[t]<<endl;
          nxt[qq] += crt[q] * fs[t];
        }
        if (!q) break;
      }
    }
// if(e<3)cerr<<nxt<<endl;
    crt = nxt;
  }
  Mint ans = 0;
  for (int q = 0; q < 1 << N; ++q) {
    ans += crt[q];
  }
  return ans;
}
}  // slow


int main() {
  for (; ~scanf("%d", &N); ) {
    R.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &R[i]);
    }
    scanf("%s", S);
    
    const Mint ans = slow::run();
    printf("%u\n", ans.x);
  }
  return 0;
}