#include <cstdio>
#include <cstring>
#include <algorithm>
#define mod 998244353
#define ll long long
using namespace std;

int n;
int r[20];
int er[20];
char c[1000005];

inline void in(int &n){
	n=0;
	char c=getchar();
	while(c<'0' || c>'9') c=getchar();
	while(c>='0'&&c<='9') n=n*10+c-'0',c=getchar();
	return ;
}

namespace sub1{

	int s;

	inline void dfs(int k,int b0,int b1){
		if(k>n){s+=(c[b0]+c[b1]=='1'*2);return ;}
		for(int i=0;i<=r[k];i++) dfs(k+1,b0+(i&1)*er[k-1],b1+((i>>1)&1)*er[k-1]);
	}

	inline void work(){dfs(1,0,0);printf("%d\n",s%mod);}
}

int main(){
	in(n);
	er[0]=1;
	for(int i=1;i<=n;i++) in(r[i]),er[i]=er[i-1]*2;
	scanf("%s",c);
	bool ok=1;
	for(int i=1;i<=n;i++) ok&=(r[i]<=3);
	ok=1;
	if(ok){sub1::work();return 0;}

	return 0;
}