#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef vector<int> vi;
typedef pair<int,int> pi;

const int N=18,S=1<<18,mod=998244353;
void inc(int &x,int y){
	if((x+=y)>=mod){
		x-=mod;
	}
}
void dec(int &x,int y){
	if((x-=y)<0){
		x+=mod;
	}
}
int n,U,r[N],w[S];
int f[61][S];

int a[S],b[S],res[S];
void fwt(int lim){
	rep(i,0,n-1){
		bool op=lim>>i&1;
		int len=1<<i;
		for(int j=0;j<U;j+=len*2){
			rep(k,j,j+len-1){
				if(op){
					inc(a[k], a[k+len]);
					inc(b[k], b[k+len]);
				}
				else{
					swap(b[k], b[k+len]);
					inc(b[k], b[k+len]);
				}
			}
		}
	}
}
void ifwt(int lim){
	per(i,n-1,0){
		bool op=lim>>i&1;
		int len=1<<i;
		for(int j=0;j<U;j+=len*2){
			rep(k,j,j+len-1){
				if(op){
					dec(res[k], res[k+len]);
				}
				// else{
					// dec(res[k], res[k+len]);
					// swap(res[k], res[k+len]);
				// }
			}
		}
	}
}
signed main(){
	// freopen("integer.in","r",stdin);
	// freopen("integer.out","w",stdout);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	
	cin>>n;
	U=(1<<n)-1;
	rep(i,0,n-1){
		cin>>r[i];
	}
	string s; cin>>s;
	rep(i,0,U){
		w[i]=(s[i]=='1');
	}
	f[60][U]=1;
	per(i,59,0){
		int lim=0;
		rep(j,0,n-1){
			if(r[j]>>i&1){
				lim|=1<<j;
			}
		}
		rep(j,0,U){
			a[j]=f[i+1][j];
			b[j]=w[j];
		}
		fwt(lim);
		rep(j,0,U){
			res[j]=a[j]*b[j]%mod;
		}
		ifwt(lim);
		rep(j,0,U){
			f[i][j]=res[j];
		}
	}
	int ans=0;
	rep(i,0,U){
		inc(ans, f[0][i]);
	}
	cout<<ans<<'\n';
}