#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cassert>
const int Q=200005;
const int INF=(1<<30);
const int mod=998244353;
typedef long long ll;
#define rg register int
#define cint const register int
//char ibuf[1<<21],*IP1=ibuf,*IP2=ibuf;
//#define gc() (__builtin_expect(IP1==IP2,0)&&(IP2=(IP1=ibuf)+fread(ibuf,1,1<<21,stdin),__builtin_expect(IP1==IP2,0))?EOF:*IP1++)
#define gc getchar
#define pc putchar
inline bool ig(const char c){return c>=48&&c<=57;}
inline void read(rg&oi){char c;rg f=1,res=0;while(c=gc(),(!ig(c))&&c^'-');c^'-'?res=(c^48):f=-1;while(c=gc(),ig(c))res=res*10+(c^48);oi=f*res;}
inline void print(rg oi){char io[23];rg l=0;if(oi<0)pc('-'),oi=~oi+1;do io[++l]=(oi%10+48);while(oi/=10);for(;l;--l)pc(io[l]);}
inline void write(cint oi,const char c){print(oi);pc(c);}char _ST_;
int prd[Q],ivp[Q];
inline int inc(cint x,cint y){return x+y<mod?x+y:x+y-mod;}
inline int dec(cint x,cint y){return x>=y?x-y:x-y+mod;}
inline int mul(cint x,cint y){return 1ll*x*y%mod;}
inline void Inc(rg&x,cint y){((x+=y)>=mod)&&(x-=mod);}
inline void Dec(rg&x,cint y){((x-=y)<0)&&(x+=mod);}
inline void Mul(rg&x,cint y){x=1ll*x*y%mod;}
inline int pow(rg x,rg y){rg res=1;for(;y;y>>=1,Mul(x,x))(y&1)&&(Mul(res,x),1);return res;}
inline int Inv(cint x){return pow(x,mod-2);}
inline int binom(cint N,cint M){return N<M||N<0||M<0?0:mul(prd[N],mul(ivp[M],ivp[N-M]));}
int n,a[Q],b[Q];
char _ED_;int main(){
	fprintf(stderr,"memory:%llu MB\n",(&_ST_-&_ED_)>>20);
	read(n);for(rg i=1;i<=n;++i)read(a[i]),a[i]%=mod;{
	char c;while(c=gc(),c^'+'&&c^'-');b[1]=(c=='-'?mod-1:1);
	for(rg i=2;i<n;++i)c=gc(),b[i]=(c=='-'?mod-1:1);}
	prd[0]=ivp[0]=1;for(rg i=1;i<=n;++i)prd[i]=mul(prd[i-1],i);
	ivp[n]=Inv(prd[n]);for(rg i=n-1;i>=1;--i)ivp[i]=mul(ivp[i+1],i+1);
	rg res=mul(prd[n-1],a[1]);
	for(rg i=1;i<n;++i){
		rg cnt=b[i];for(rg j=i-1;j>=1;--j)Mul(cnt,inc(i-j,b[j]));
		Inc(res,mul(cnt,mul(mul(prd[n-1],ivp[i]),a[i+1])));
	}
	write(res,'\n');
	return 0;
}