#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
constexpr int Max=18,Size=1<<18;
constexpr ll mod=998244353;
inline void mod_add(ll &x,const ll &y)
{
	x+=y;
	if(x>=mod)
		x-=mod;
}
ll b[Max];
int a[Max],n,m;
int p[Size],q[Size];
ll f[Size],g[Size];
void solve()
{
	vector<int>a0,a1;
	vector<int>s0,s1;
	auto fmt=[](ll *f,int o,const vector<int>&a,const vector<int>&s)->void
	{
		for(int j:a)
			for(int u:s)
				if(u>>j&1)
					mod_add(f[u|o],f[(u^(1<<j))|o]);
	};
	auto ifmt=[](ll *f,int o,const vector<int>&a,const vector<int>&s)->void
	{
		for(int j:a)
			for(int u:s)
				if(u>>j&1)
					mod_add(f[u|o],mod-f[(u^(1<<j))|o]);
	};
	auto fmt_int=[](int *f,int o,const vector<int>&a,const vector<int>&s)->void
	{
		for(int j:a)
			for(int u:s)
				if(u>>j&1)
					f[u|o]+=f[(u^(1<<j))|o];
	};
	for(int i=0;i<n;++i)
		if(a[i])
			a1.push_back(i);
		else
			a0.push_back(i);
	int len0=a0.size(),len1=a1.size();
	for(int S=0;S<1<<len0;++S)
	{
		int T=0;
		for(int i=0;i<len0;++i)
			if(S>>i&1)
				T|=1<<a0[i];
		s0.push_back(T);
	}
	for(int S=0;S<1<<len1;++S)
	{
		int T=0;
		for(int i=0;i<len1;++i)
			if(S>>i&1)
				T|=1<<a1[i];
		s1.push_back(T);
	}
	fill(q,q+m,0);
	for(int S=0;S<m;++S)
		if(p[S])
			q[S^s1.back()]=1;
	for(auto o:s1)
		fmt_int(q,o,a0,s0);
	for(auto o:s0)
	{
		fmt(f,o,a1,s1);
		fmt_int(q,o,a1,s1);
		for(auto i:s1)
			(f[i|o]*=q[i|o])%=mod;
		ifmt(f,o,a1,s1);
	}
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	cin>>n,m=1<<n;
	for(int i=0;i<n;++i)
		cin>>b[i];
	char ch;
	for(int i=0;i<m;++i)
		cin>>ch,p[i]=ch-'0';
	f[0]=1;
	for(int k=__lg(*max_element(b,b+n));~k;--k)
	{
		for(int i=0;i<n;++i)
			a[i]=b[i]>>k&1;
		solve();
	}
	ll ans=0;
	for(int i=0;i<m;++i)
		mod_add(ans,f[i]);
	cout<<ans<<"\n";
	return 0;
}