#pragma comment(linker, "/STACK:10240000")

#include <map>

#include <set>

#include <cmath>

#include <ctime>

#include <deque>

#include <queue>

#include <stack>

#include <vector>

#include <cstdio>

#include <string>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define X                   first

#define Y                   second

#define pb                  push_back

#define mp                  make_pair

#define all(a)              (a).begin(), (a).end()

#define fillchar(a, x)      memset(a, x, sizeof(a))

#define copy(a, b)          memcpy(a, b, sizeof(a))

typedef long long ll;

typedef pair<int, int> pii;

typedef unsigned long long ull;

//#ifndef ONLINE_JUDGE

void RI(vector<int>&a,int n){a.resize(n);for(int i=;i<n;i++)scanf("%d",&a[i]);}

void RI(){}void RI(int&X){scanf("%d",&X);}template<typename...R>

void RI(int&f,R&...r){RI(f);RI(r...);}void RI(int*p,int*q){int d=p<q?:-;

while(p!=q){scanf("%d",p);p+=d;}}void print(){cout<<endl;}template<typename T>

void print(const T t){cout<<t<<endl;}template<typename F,typename...R>

void print(const F f,const R...r){cout<<f<<", ";print(r...);}template<typename T>

void print(T*p, T*q){int d=p<q?:-;while(p!=q){cout<<*p<<", ";p+=d;}cout<<endl;}

//#endif

template<typename T>bool umax(T&a, const T&b){return b<=a?false:(a=b,true);}

template<typename T>bool umin(T&a, const T&b){return b>=a?false:(a=b,true);}

const double PI = acos(-1.0);

const int INF = 1e9 + ;

const double EPS = 1e-12;

/* -------------------------------------------------------------------------------- */

template<int mod>

struct ModInt {

    const static int MD = mod;

    int x;

    ModInt(ll x = ): x(x % MD) {}

    int get() { return x; }

    ModInt operator + (const ModInt &that) const { int x0 = x + that.x; return ModInt(x0 < MD? x0 : x0 - MD); }

    ModInt operator - (const ModInt &that) const { int x0 = x - that.x; return ModInt(x0 < MD? x0 + MD : x0); }

    ModInt operator * (const ModInt &that) const { return ModInt((long long)x * that.x % MD); }

    ModInt operator / (const ModInt &that) const { return *this * that.inverse(); }

    ModInt operator += (const ModInt &that) { x += that.x; if (x >= MD) x -= MD; }

    ModInt operator -= (const ModInt &that) { x -= that.x; if (x < ) x += MD; }

    ModInt operator *= (const ModInt &that) { x = (long long)x * that.x % MD; }

    ModInt operator /= (const ModInt &that) { *this = *this / that; }

    ModInt inverse() const {

        int a = x, b = MD, u = , v = ;

        while(b) {

            int t = a / b;

            a -= t * b; std::swap(a, b);

            u -= t * v; std::swap(u, v);

        }

        if(u < ) u += MD;

        return u;

    }

};

typedef ModInt<> mint;

const int maxn = 1e2 + ;

const int md = 1e9 + ;

mint dp[maxn][maxn], fac[maxn], facinv[maxn];

int a[maxn];

char s[maxn];

mint get(mint a, char ch, mint b, mint ca, mint cb) {

    if (ch == '+') return a * cb + b * ca;

    if (ch == '-') return a * cb - b * ca;

    if (ch == '*') return a * b;

}

void init() {

    fac[] = facinv[] = ;

    for (int i = ; i < maxn; i ++) fac[i] = fac[i - ] * i;

    for (int i = ; i < maxn; i ++) facinv[i] = facinv[i - ] / i;

}

int main() {

#ifndef ONLINE_JUDGE

    freopen("in.txt", "r", stdin);

    //freopen("out.txt", "w", stdout);

#endif // ONLINE_JUDGE

    int n;

    init();

    while (cin >> n) {

        for (int i = ; i <= n; i ++) {

            scanf("%d", a + i);

        }

        scanf("%s", s);

        fillchar(dp, );

        for (int i = ; i <= n; i ++) dp[i][i] = a[i];

        for (int L = ; L <= n; L ++) {

            for (int i = ; i + L -  <= n; i ++) {

                int j = i + L - ;

                for (int k = i; k < j; k ++) {

                    dp[i][j] += get(dp[i][k], s[k - ], dp[k + ][j], fac[k - i], fac[j - k - ]) * fac[j - i - ] * facinv[k - i] * facinv[j - k - ];

                }

            }

        }

        printf("%d\n", dp[][n].get());

    }

    return ;

}