#include<bits/stdc++.h>
//#include <ext/pb_ds/hash_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
namespace infinities{
    #define fint register int
    #define ls(i) (i << 1)
    #define rs(i) ((i << 1) | 1)
    #define pii pair<int, int>
    #define im int mid = (l + r) >> 1
    #define INT __int128
    #define ll long long
    #define ui unsigned int
    #define lc ch[now][0]
    #define rc ch[now][1]
    const int mod = 998244353, INF = 998244353, maxn = 5e5 + 7;
    namespace FastIO{//10M
        const int SS = 1e7; char num_[50]; int cnt_;
        inline int xchar(){static char buf[SS]; static int len = 0, pos = 0; if(pos == len)pos = 0, len = fread(buf, 1, SS, stdin); if(pos == len)exit(0); return buf[pos++];}
        inline int read(){fint x = 0, f = 1, ch = getchar(); while(ch < '0' || ch > '9'){if(ch == '-')f = -1; ch = getchar();}while(ch >= '0' && ch <= '9'){x = (x << 1) + (x << 3) + (ch ^ 48); ch = getchar();} return x * f;}
        inline ll readll(){ll x = 0, f = 1, ch = getchar(); while(ch < '0' || ch > '9'){if(ch == '-')f = -1; ch = getchar();}while(ch >= '0' && ch <= '9'){x = (x << 1ll) + (x << 3ll) + (ch ^ 48ll); ch = getchar();} return x * f;}
		inline void write(int x){if(x == 0){putchar('0'); return;}if(x < 0)putchar('-'), x = -x; while(x)num_[++cnt_] = x % 10 ^ 48,x /= 10; while(cnt_)putchar(num_[cnt_--]);}
        inline void write(int x, char c){write(x), putchar(c);}
    }
    using namespace std;
    using namespace FastIO;
    namespace mystd{
        inline int qmin(int a, int b){return (a > b) ? b : a;} inline int qmax(int a, int b){return (a > b) ? a : b;}
        inline void chkmin(int &a, int b){a = min(a, b); return;} inline void chkmax(int &a, int b){a = max(a, b); return;}
        inline void qk(int &a, int b){a = (a + b); a = (a >= mod) ? a - mod : a;}
        inline void sub(int &a, int b){a = a - b; a = (a < 0) ? a + mod : a;}
		inline int mul(int a, int b){return (1ll * a * b % mod + mod) % mod;}
        inline int qpow(int x, int k){fint res = 1; for(; k; k = (k >> 1), x = 1ll * x * x % mod)if(k & 1)res = 1ll * res * x % mod; return res;}
        inline void looked(int a[], int n){for(fint i = 1; i < n; i++)write(a[i], ' '); write(a[n], '\n');} inline void debug(){puts("qwq");} inline void YES(){puts("YES");} inline void Yes(){puts("Yes");} inline void yes(){puts("yes");} inline void NO(){puts("NO");} inline void No(){puts("No");} inline void no(){puts("no");}
    }
	using namespace mystd;
	//using namespace __gnu_pbds;
	//gp_hash_table<int, int>hsh;
    void file(){freopen("a.in", "r", stdin), freopen("a.out", "w", stdout);}
    int n, s[(1 << 18) + 10], f[2][(1 << 18) + 10], lim, g[(1 << 18) + 10], a[maxn];
    int p[62], pos[62], change[(1 << 18) + 20], from[(1 << 18) + 20];
    int num[62];
    pii q[30];
    ll r[20];
    int calc(ll x){fint res = -1; while(x){++res, x >>= 1;} return res;}
    void FWT(int *a, int opt, int len){
		for(fint l = 1, o = 0; o < len; l <<= 1, o++){
			for(fint i = 0; i < (1 << n); i += (l << 1)){
				for(fint j = i; j < l + i; j++){
					if(opt == 1)qk(a[j], a[j + l]);else sub(a[j], a[j + l]);
				}
			}
		}
	}
	int work(int S){
		fint as = 0;
		for(fint i = 0; i < n; i++)as |= (((S >> p[i]) & 1) << i);
		return as;
	}
    signed main(){
    	n = read();
    	for(fint i = 1; i <= n; i++){r[i] = readll(); lim = max(lim, calc(r[i]));}
    	for(fint i = 0; i < (1 << n); i++)s[i] = getchar() - '0';
    	for(fint i = lim; i >= 0; i--){
			for(fint j = 1; j <= n; j++)num[i] |= ((r[j] >> i) & 1) << j - 1;
		}
    	f[(lim + 1) & 1][(1 << n) - 1] = 1;
		for(fint i = lim; i >= 0; i--){
			fint num1 = 0, cg = 0;
			for(fint j = 1; j <= n; j++){
				if(num[i] & (1 << j - 1))++num1;else cg |= (1 << j - 1);
				q[j] = {((num[i] >> j - 1) & 1) ^ 1, j - 1};
			}
			sort(q + 1, q + 1 + n);
			for(fint j = 0; j < n; j++)p[j] = q[j + 1].second, pos[q[j + 1].second] = j;
			for(fint S = 0; S < (1 << n); S++){fint k = work(S); change[S] = k, from[k] = S;}
			for(fint S = 0; S < (1 << n); S++)g[change[S]] = s[S ^ cg], a[change[S]] = f[(i + 1) & 1][S];
			for(fint j = n; j >= 1; j--){
				if(q[j].first == 0)break;
				for(fint S = (1 << n) - 1; S >= 0; S--)if((S & (1 << j - 1)) == 0)qk(g[S], g[S | (1 << j - 1)]);
			}
			FWT(a, 1, num1), FWT(g, 1, num1);
			for(fint S = 0; S < (1 << n); S++)a[S] = 1ll * a[S] * g[S] % mod;
			FWT(a, -1, num1);
			for(fint S = 0; S < (1 << n); S++){f[i & 1][from[S]] = a[S], f[(i + 1) & 1][S] = 0;}
		}
		fint res = 0;
		for(fint S = 0; S < (1 << n); S++)qk(res, f[0][S]);
		cout << res;
        return 0;
    }
}
signed main(){
    return infinities::main();
}