#include "bits/stdc++.h"
using namespace std;
#ifdef DEBUG
#define dbg(x) cout << (#x) << " = " << (x) << "\n";
#else
#define dbg(x)
#endif

typedef long long ll;
typedef pair<int, int> pi;
const int N = 105;
const int M = 1;
const int inf = 1e9;
constexpr int mod = 998244353;
int n, m, k, qq;
int c[M];
string s;
void E() {
    cout << "error\n";
    exit(0);    
}

int add(int x, int y) {
    x += y;
    if (x >= mod) x -= mod;
    return x;
}

int mul(int x, int y) {
    return (ll)x * y % mod;
}

int tonum(string t) {
    int res = 0;
    for (char c : t) {
        int x = c - '0';
        res = add(mul(res, 10), x);
    }
    
    return res;
}

void solve() {
    cin >> m;
    for (int i = 0; i < m; i++) {
        cin >> c[i];
    }
    
    cin >> s;
    n = s.size();
    string x;
    vector<int> vals;
    string ops;
    for (int i = 0; i < n; i++) {
        if (s[i] == '+' || s[i] == '*') {
            if (x.size() != 1) E();
            if (x[0] != '1') E();
            x.clear();
            ops.push_back(s[i]);
        }
        
        else if (s[i] == '.') {
            if (x.empty()) E();
            vals.push_back(tonum(x));
            x.clear();
        }
        
        else if (s[i] >= '0' || s[i] <= '9') x.push_back(s[i]);
        else E();
    }
    
    if (!x.empty()) E();
    if (vals.size() == ops.size()) E();
    int sz = ops.size();
    int out = 0;
    if (!c[0]) {
        out = vals[0];
        for (int i = 0; i < sz; i++) {
            if (ops[i] == '+') out = add(out, vals[i + 1]);
            if (ops[i] == '*') out = mul(out, vals[i + 1]);
        }
    }
    
    else {
        out = vals[sz];
        for (int i = sz - 1; i >= 0; i--) {
            if (ops[i] == '+') out = add(out, vals[i]);
            if (ops[i] == '*') out = mul(out, vals[i]);
        }
    }
    
    cout << out << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
}