#include<bits/stdc++.h>
using namespace std;
template<typename T>inline void read(T &x){
	x=0;
	char ch=getchar();
	bool flag=0;
	while(ch>'9'||ch<'0') flag=flag||ch=='-',ch=getchar();
	while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
	x=flag?-x:x;
}
template<typename T,typename ...Args>inline void read(T &x,Args &...args){
	read(x),read(args...);
}
template<typename T>inline void prt(T x){
	if(x>9) prt(x/10);
	putchar(x%10+'0');
}
template<typename T>inline void put(T x){
	if(x<0) putchar('-'),x=-x;
	prt(x);
}
template<typename T>inline void put(char ch,T x){
	put(x),putchar(ch);
}
template<typename T,typename ...Args>inline void put(char ch,T x,Args ...args){
	put(ch,x),put(ch,args...);
}
inline int getch(){
	char ch=getchar();
	while(ch!='0'&&ch!='1') ch=getchar();
	return ch-'0';
}
#define ll long long
#define p 998244353
#define N 20
#define S 263005
struct modint{
	int v;
	modint(){v=0;}
	template<typename T>modint(T _v):v(_v>=p?_v%p:_v){}
	template<typename T>explicit operator T()const{return v;}
};
inline modint operator==(const modint &x,const modint &y){return (int)x==(int)y;}
inline modint operator+(const modint &x,const modint &y){return modint(x.v+y.v>=p?x.v+y.v-p:x.v+y.v);}
inline modint operator-(const modint &x,const modint &y){return modint(x.v<y.v?x.v-y.v+p:x.v-y.v);}
inline modint operator*(const modint &x,const modint &y){return modint(1ll*x.v*y.v%p);}
inline modint &operator+=(modint &x,modint y){return x=x+y;}
inline modint &operator-=(modint &x,modint y){return x=x-y;}
inline modint &operator*=(modint &x,modint y){return x=x*y;}
inline modint operator-(const modint &x){return modint(x.v?p-x.v:x.v);}
inline modint power(modint x,int y){
	modint res=1;
	while(y){
		if(y&1) res*=x;
		x*=x,y>>=1;
	}
	return res;
}
int n,val[65];
ll w[N];
modint f[S],g[S],tmp[S];
inline void FWT(modint *c,int dis,modint typ,int op){
	for(int arc=1;arc<(1<<n);arc<<=1){
		for(int i=0;i<(1<<n);i+=arc+arc){
			for(int j=0;j<arc;j++){
				modint x=c[i+j],y=c[i+j+arc];
				if(dis&arc) c[i+j]=x+y*typ;
				else if(typ==1&&op) c[i+j]=x+y,c[i+j+arc]=x;
			}
		}
	}
}
int main(){
	read(n);
	for(int i=1;i<=n;i++){
		read(w[i]);
		for(int j=0;j<60;j++) val[j]|=(w[i]>>j&1)<<(i-1);
	}
	for(int i=0;i<(1<<n);i++) g[i]=getch();
	f[(1<<n)-1]=1;
	for(int j=59;~j;j--){
		for(int s=0;s<(1<<n);s++) tmp[s]=g[s];
		FWT(f,val[j],1,0),FWT(tmp,val[j],1,1);
		for(int s=0;s<(1<<n);s++) f[s]*=tmp[s];
		FWT(f,val[j],p-1,0);
	}
	modint res=0;
	for(int s=0;s<(1<<n);s++) res+=f[s];
	put('\n',res.v);
	return 0;
}