// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

fn main() {
    solve();
}

//input output
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

fn solve() {
    let n: usize = read();
    let a = read_vec::<String>();
    let b = read_vec::<String>();
    let mut card_for_1_8 = vec![];
    let mut card_for_9 = vec![];
    for i in 0..n {
        let aa = a[i].parse::<i64>().unwrap();
        let bb = b[i].clone();
        if bb.contains("X") && bb.len() == 1 {
            card_for_9.push(aa);
        } else if !bb.contains("X") {
            let bb = bb.parse::<i64>().unwrap();
            card_for_1_8.push((aa, bb));
        }
    }
    let mut dp = vec![vec![vec![vec![0; 9]; 34]; 34]; card_for_1_8.len() + 1];
    dp[0][0][0][0] = 1;
    for i in 0..card_for_1_8.len() {
        for j in 0..5 {
            for k in 0..34 {
                for l in 0..=8 {
                    if dp[i][j][k][l] == 0 {
                        continue;
                    }
                    let (a, b) = card_for_1_8[i];
                    let a = a as usize;
                    let b = b as usize;
                    if l < 8 && j + a <= 4 && k + b <= 33 {
                        dp[i + 1][j + a][k + b][l + 1] += dp[i][j][k][l];
                        dp[i + 1][j + a][k + b][l + 1] %= UMOD;
                    }
                    dp[i + 1][j][k][l] += dp[i][j][k][l];
                    dp[i + 1][j][k][l] %= UMOD;
                }
            }
        }
    }
    let mut res = 0;
    let mut mul = 1;
    for i in 1..=8 {
        mul *= i;
    }
    mul = 1;
    // d!(card_for_1_8);
    // d!(card_for_9);
    for x in card_for_9 {
        res += dp[card_for_1_8.len()][4 - x as usize][33][8] * mul;
        res %= UMOD;
    }
    println!("{}", res);

    return;
}