bool M1;
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<iomanip>
#include<cassert>
#include<random>
#include<cstdio>
#include<vector>
#include<bitset>
#include<stack>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<array>
#include<map>
#include<set>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/hash_policy.hpp>
//#include<ext/pb_ds/priority_queue.hpp>
#define fi first
#define se second
#define ll long long
#define Vector Point
#define I128 __int128
#define LD long double
#define ull unsigned ll
#define pii pair<int,int>
#define pb(x) push_back(x)
#define syt cerr<<"sytakioi\n"
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define rd_i(l,r) uniform_int_distribution<int>(l,r)(rd)
#define rd_r(l,r) uniform_real_distribution<double>(l,r)(rd)
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
using namespace std;
//using namespace __gnu_cxx;
mt19937 rd(time(0));
const int N=18;
const int M=1<<18;
const int p=998244353;
int n;
ll a[N];
char c[M];
ll f[M],g[M],h[M];
inline void add(ll &x,ll y){(x+=y)>=p?x-=p:x;}
bool M2;
int main(){
	int Time=clock();
	look_memory;
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n;
	F(i,0,n-1) cin>>a[i];
	F(S,0,(1<<n)-1) cin>>c[S];
	f[(1<<n)-1]=1;
	UF(j,60,0){
		F(S,0,(1<<n)-1) g[S]=c[S]-'0';
		F(i,0,n-1){
			if((a[i]>>j)&1){
				F(S,0,(1<<n)-1) if((S>>i)&1) add(g[S^(1<<i)],g[S]),add(f[S^(1<<i)],f[S]);
			}else{
				F(S,0,(1<<n)-1) if((S>>i)&1) swap(g[S^(1<<i)],g[S]),add(g[S^(1<<i)],g[S]);
			}
		}
		F(S,0,(1<<n)-1) h[S]=f[S]*g[S]%p;
		F(i,0,n-1) if((a[i]>>j)&1) F(S,0,(1<<n)-1) if((S>>i)&1) add(h[S^(1<<i)],p-h[S]);
		F(S,0,(1<<n)-1) f[S]=h[S],h[S]=0;
	}
	ll ans=0;
	F(S,0,(1<<n)-1) add(ans,f[S]);
	cout<<ans<<'\n';
	look_time;
	return 0;
}