#include <bits/stdc++.h>
#define sz(A) (int)A.size() 

using std :: cin;
using std :: min; 
using std :: max; 
using std :: cout; 
using std :: vector; 

constexpr int M = 2e5 + 5, mod = 998244353; 
constexpr int INF = 0x3f3f3f3f; 

typedef long long ll; 
typedef unsigned long long ull; 
typedef double db; 

inline int read() { 
	int f = 1, s = 0; char ch = getchar(); 
	while(!isdigit(ch)) (ch == '-') && (f = -1), ch = getchar(); 
	while(isdigit(ch)) s = s * 10 + ch - '0', ch = getchar(); 
	return f * s; 
}

namespace Solver {
	int n; int a[M], sgn[M]; 
	char op[M]; 
	int fac[M], ifac[M]; 
	inline int qpow(int a, int b, int p) {
		int s = 1; 
		for(int bas = a; b; b >>= 1, bas = (ll)bas * bas % p)  
		    if(b & 1) s = (ll)s * bas % p;
		return s; 
	}
	inline void init(int n) {
		fac[0] = ifac[0] = 1; 
		for(int i = 1; i <= n; ++i) fac[i] = (ll)fac[i - 1] * i % mod; 
		ifac[n] = qpow(fac[n], mod - 2, mod); 
		for(int i = n; i; --i) ifac[i - 1] = (ll)ifac[i] * i % mod; 
	}
	inline int add(int x, int y) {return (x += y) >= mod ? x - mod : x;} 
	inline void Ad(int &x, const int &y) {if((x += y) >= mod) x -= mod;}
	inline void mian() { 
		n = read(), init(n); 
		for(int i = 1; i <= n ; ++i) a[i] = read(); 
		scanf("%s", op + 1); 
		for(int i = 1; i < n; ++i) sgn[i] = (op[i] == '+' ? 1 : mod - 1); 
		int s = a[1]; 
		for(int i = 2; i <= n; ++i) {
			int prd = 1; 
			for(int j = i - 1; j >= 1; --j) prd = (ll)prd * (sgn[j] + i - j - 1) % mod; 
			s = add(s, (ll)a[i] * ifac[i - 1] * prd % mod); 
		}
		cout << (ll)s * fac[n - 1] % mod; 
	}
} ; 


int main() 
{
	
	Solver :: mian(); 
}