#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int > 
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
#define i128 __int128 
using namespace std;
const int N = 1 << 20, M = 20, mod = 998244353; 
int n, dp[1 << M];
char s[N];
ll R[N];
int cnt[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0); 
	cin >> n;
	L(i, 0, n - 1) {
		cin >> R[i];
	}
	cin >> s;
	dp[0] = 1;
	R(t, 60, 0) {
		L(i, 0, (1 << n) - 1) 
			cnt[i] = s[i] == '1';
		L(i, 0, n - 1) 
			if(R[i] >> t & 1) {
				L(j, 0, (1 << n) - 1) 
					if(!(j >> i & 1)) {
						swap(cnt[j], cnt[j + (1 << i)]);
					}
			} else {
				L(j, 0, (1 << n) - 1) if(!(j >> i & 1)) {
					cnt[j + (1 << i)] += cnt[j];
				}
			}
		
//		if(t == 2) {
//			cout << "cnt : ";
//			L(i, 0, (1 << n) - 1) 
//				cout << cnt[i] << ' ';
//			cout << '\n';
//			L(i, 0, n - 1) 
//				cout << (R[t] >> i & 1);
//			cout << '\n';
//		}
		
		L(i, 0, n - 1) 
			if(R[i] >> t & 1) {
				L(j, 0, (1 << n) - 1) if(!(j >> i & 1)) 
					(cnt[j + (1 << i)] += cnt[j]) %= mod;
				L(j, 0, (1 << n) - 1) if(!(j >> i & 1)) 
					(dp[j + (1 << i)] += dp[j]) %= mod;
			} 
		L(i, 0, (1 << n) - 1) 
			dp[i] = (ll) dp[i] * cnt[i] % mod;
		
		L(i, 0, n - 1) 
			if(R[i] >> t & 1) 
				L(j, 0, (1 << n) - 1) if(!(j >> i & 1)) 
					(dp[j + (1 << i)] += mod - dp[j]) %= mod;
		
//		cout << t << " : ";
//		L(i, 0, (1 << n) - 1) 
//			cout << dp[i] << ' ';
//		cout << '\n';
	}
	int s = 0;
	L(i, 0, (1 << n) - 1) 
		(s += dp[i]) %= mod;
	cout << s << '\n';
	return 0;
} 
/*
[0,1,0,1] [1,1,1,1]
          0,1,0,1
[0,0,0,0] [1,1,1,1]
做一遍 (逆) 高维前缀和. 

0,1,0,1
0,1,0,1
0,1,0,1

0 + [0] -> 1
0 + [1] -> 0
1 + ? ->   1
*/