// #include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<string>
using namespace std;
using ll = long long;
using vi=vector<int>;   
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define INF (ll)(2e18)
//#define MOD ((ll)1e9+7)
#define MOD (998244353)
const int di[]={0,1,-1,0};
const int dj[]={1,0,0,-1};


#define MAX 100000

ll dp[10][5][34]={0};
int main(){

	int n;cin>>n;
	dp[0][0][0]=1;

	vector<string> as(n),bs(n);
	rep(i,n)cin>>as[i];
	rep(i,n){
		cin>>bs[i];
		//cout<<bs[i]<<" ";
	}
	vi an,bn;
	vi exa,exb;

	//cout<<dp[9][4][33]<<endl;
	rep(i,n){
		if(bs[i][bs[i].size()-1]=='X'){
			exa.push_back(stoi(as[i]));
			bs[i]=bs[i].substr(0,bs[i].size()-1);
			if(bs[i].empty())bs[i]="0";
			exb.push_back(stoi(bs[i]));
			//cout<<exb[exb.size()-1]<<endl;
			continue;
		}

		an.push_back(stoi(as[i]));
		bn.push_back(stoi(bs[i]));
	
	}

	rep(i,an.size()){
		int a,b;
		a=an[i],b=bn[i];
		for(int c=8;c>=1;c--){
			for(int u=4;u>=0;u--){
				for(int d=33;d>=0;d--){
					if(u-a<0)continue;
					if(d-b<0)continue;
					dp[c][u][d]+=dp[c-1][u-a][d-b];
					dp[c][u][d]%=MOD;
				}
			}
		}
	}


	rep(i,exa.size()){
		int a=exa[i],b=exb[i];
		if(b!=0)continue;

		dp[9][4][33]+=dp[8][4-a][33-b];
		dp[9][4][33]%=MOD;
	}
	cout<<dp[9][4][33]<<endl;

	return 0;
}