#include <stdio.h>
#include <math.h>
#include <vector>
#include <string>
#include <string.h>
#include <time.h>
#include <cassert>
#include <stdlib.h>
#include <map>
#define ll long long
#define prime_count 150

using namespace std;

map <int, bool> primeMap;
int n, P[prime_count + 1], R[prime_count + 1];

inline bool isPrime(int number) {
    if (number % 2 == 0)
        return 0;
    for (int d = 3; d * d <= number; d += 2)
        if (number % d == 0)
            return 0;
    return 1;
}

char tmp[1100];

//Numere mari by SpiderMan $$$

# define MAX 2500 // * nbase = numarul de cifre
# define verf( X, i ) ( i <= X[0] ? X[i] : 0 )
# define A ( *this )

class Mare : protected vector < int > {
    static const int base = 1000000000, nbase = 9 ;
public :
    Mare ( ) ;
    Mare ( int ) ;

    void operator   = ( char* ) ;
    void operator  += ( Mare& ) ;
    void operator  *= ( int ) ;
    void operator  *= ( Mare& ) ;
    void operator  -= ( Mare& ) ;
    void operator <<= ( int ) ;
    void operator >>= ( int ) ;
    void operator  /= ( int ) ;
    void operator  /= ( Mare& ) ;
    void operator  %= ( int ) ;
    void operator  %= ( Mare& ) ;
    void operator  ++ ( void ) ;
    void operator  ++ ( int ) ;
    void operator  -- ( void ) ;
    void operator  -- ( int ) ;

    Mare operator  + ( Mare& ) ;

    int  zero         ( void ) ;
    int  comparare    ( Mare& ) ;

    bool operator  <  ( Mare& ) ;
    bool operator  <= ( Mare& ) ;
    bool operator  >  ( Mare& ) ;
    bool operator  >= ( Mare& ) ;
    bool operator  == ( Mare& ) ;
    bool operator  != ( Mare& ) ;

    void operator  |= ( Mare& ) ;
    void operator  &= ( Mare& ) ;
    void operator  ^= ( Mare& ) ;

    void afis           ( void ) ;
    void afis_rad       ( int ) ;
    void obtain         ( int, int* ) ;
    void pow            ( int ) ;
    void radical_cb     ( Mare& ) ;
    void radical_normal ( Mare&, int ) ;
    void transform_2    ( int* ) ;
    void transform_10   ( int* ) ;
    void transform_210  ( int* ) ;
    int toInt( void );
} ;

Mare :: Mare () { // A = 0
    this -> resize ( MAX ) ;
}

Mare :: Mare ( int X ) { // A = X
    this -> resize ( MAX ) ;
    for ( A[0] = 0; X ; X /= base ) {
        A[ ++A[0] ] = X % base ;
    }
}

void Mare :: operator = ( char *X ) { // A = X ( sir )
    A[0] = 0;
    if ( X ) {
        for ( int h = strlen ( X ) ; h > 0 ; h -= nbase ) {
            ++A[0] ;
            for ( int i = max ( 0, h - nbase ) ; i < h; ++i ) {
                A[ A[0] ] = A[ A[0] ] * 10 + X[i] - '0' ;
            }
        }
    }
}

void Mare :: operator += ( Mare &B ) { // A += B
    int i, t = 0;
    for ( i = 1; i <= A[0] || i <= B[0] || t; ++i, t /= base )
        A[i] = ( t += verf ( A, i ) + verf ( B, i ) ) % base ;
    A[0] = i - 1;
}

void Mare :: operator *= ( int B ) { // A *= B
    int i = 1;
    for ( long long t = 0; i <= A[0] || t; ++i, t /= base )
        A[i] = ( t += 1LL * verf ( A, i ) * B ) % base ;
    A[0] = i - 1;
}

void Mare :: operator *= ( Mare &B ) { // A *= B
    Mare C  ;
    for ( int i = 1, j; i <= A[0]; ++i ) {
        long long t = 0 ;
        for ( j = 1; j <= B[0] || t; ++j, t /= base)
            C[i + j - 1] = ( t += C[i + j - 1] + 1LL * verf ( A, i ) * verf ( B, j ) ) % base;
        if ( i + j - 2 > C[0] )
            C[0] = i + j - 2;
    }

    A = C ;
}

void Mare :: operator -= ( Mare &B ) { // A -= B, ∀ A ≥ B
    int t = 0;
    for ( int i = 1; i <= A[0]; ++i ) {
        t = ( A[i] -= verf ( B, i ) + t ) < 0 ;
        A[i] += t * base ;
    }
    for ( ; A[0] > 1 && !A[A[0]]; --A[0] ) ;
}

void Mare :: operator <<= ( int Count ) { // A *= 10^Count
    if ( Count ) {
        if ( A.zero () ) A = 1 ;
        Mare sol = 10 ;
        sol.pow ( Count ), A *= sol ;
    }
}

void Mare :: operator >>= ( int Count ) { // A /= 10^Count
    if ( Count ) {
        Mare sol = 10 ;
        sol.pow ( Count ), A /= sol ;
    }
}

void Mare :: operator /= ( int B ) { // A /= B
    long long t = 0;
    for ( int i = A[0]; i > 0; i--, t %= B )
        A[i] = ( t = 1LL * t * base + A[i] ) / B ;
    for ( ; A[0] > 1 && !A[ A[0] ]; --A[0] ) ;
}

# define ck ( i / nbase + ( i % nbase != 0 ) )

void Mare :: operator /= ( Mare &B ) { // A /= B
    int X[MAX * nbase];
    Mare R = 0, T ;

    A.transform_10 ( X ) ;
    fill_n ( A.begin () + 1, A[0], 0 ) ;
    for ( int i = X[0]; i ; --i ) {
        R *= R.zero () ? 0 : 10, T = X[i], R += T ;
        for ( A[ ck ] *= 10; B <= R ; ++A[ ck ], R -= B ) ;
    }

    for ( ; !A[ A[0] ] && A[0] > 1 ; --A[0] ) ;
}

void Mare :: operator %= ( int B ) { // A %= B
    long long t = 0;
    for ( int i = A[0]; i ; --i )
        t = ( 1LL * t * base + A[i] ) % B ;
    A = t ;
}

void Mare :: operator %= ( Mare &B ) { // A %= B
    int X[MAX * nbase] ; Mare R = 0, T, C ;

    A.transform_10 ( X ) ;
    fill_n ( C.begin () + 1, A[0], 0 ) ;
    for ( int i = X[0]; i ; --i ) {
        R *= R.zero () ? 0 : 10, T = X[i], R += T ;
        for ( C[ ck ] *= 10; B <= R ; ++C[ ck ], R -= B ) ;
    }

    A = R ;
}

# undef ck

void Mare :: operator ++ ( void ) { // ++A
    Mare B = 1 ;
    A += B ;
}

void Mare :: operator ++ ( int ) { // A++
    ++A ;
}

void Mare :: operator -- ( void ) { // --A
    Mare B = 1 ;
    A -= B ;
}

void Mare :: operator -- ( int ) { // A--
    --A ;
}

Mare Mare :: operator + ( Mare &B ) { // C = A + B
    int i, t = 0; Mare C ;

    for ( i = 1; i <= A[0] || i <= B[0] || t; ++i, t /= base )
        C[i] = ( t += verf ( A, i ) + verf ( B, i ) ) % base ;
    C[0] = i - 1;

    return C ;
}

int Mare :: zero ( void ) { // A == 0 ?
    return A[0] == 0 || A[0] == 1 && A[1] == 0 ;
}

int Mare :: comparare ( Mare &B ) {
    for ( ; A[0] && !A[A[0]] ; --A[0] ) ;
    for ( ; B[0] && !B[B[0]] ; --B[0] ) ;

    if ( A[0] < B[0] ) return -1;
    else if ( A[0] > B[0] ) return 1;

    for ( int i = A[0]; i > 0; --i )
        if ( A[i] < B[i] ) return -1;
        else if ( A[i] > B[i] ) return 1;

    return 0;
}

bool Mare :: operator < ( Mare &B ) { // A < B ?
    return A.comparare ( B ) == -1 ;
}

bool Mare :: operator <= ( Mare &B ) { // A <= B ?
    return A.comparare ( B ) != 1 ;
}

bool Mare :: operator > ( Mare &B ) { // A > B ?
    return A.comparare ( B ) == 1 ;
}

bool Mare :: operator >= ( Mare &B ) {// A >= B ?
    return A.comparare ( B ) != -1 ;
}

bool Mare :: operator == ( Mare &B ) {// A == B ?
    return A.comparare ( B ) == 0 ;
}

bool Mare :: operator != ( Mare &B ) {// A != B ?
    return A.comparare ( B ) != 0 ;
}

void Mare :: operator |= ( Mare &B ) { // A |= B
    int X[MAX * nbase], Y[MAX * nbase] ;
    A.transform_2 ( X ) , B.transform_2 ( Y ) ;
    for ( int i = 1; i <= X[0] && i <= Y[0]; ++i )
        X[i] |= Y[i] ;
    if ( X[0] < Y[0] ) {
        for ( int i = X[0] + 1 ; i <= Y[0] ; ++i )
            X[i] = Y[i] ;
        X[0] = Y[0] ;
    }
    A.transform_210 ( X ) ;
}

void Mare :: operator &= ( Mare &B ) { // A &= B
    int X[MAX * nbase], Y[MAX * nbase] ;
    A.transform_2 ( X ) , B.transform_2 ( Y ) ;
    for ( int i = 1; i <= X[0] && i <= Y[0]; ++i )
        X[i] &= Y[i] ;
    X[0] = min ( X[0], Y[0] ) ;
    A.transform_210 ( X ) ;
}

void Mare :: operator ^= ( Mare &B ) { // A ^= B
    int X[MAX * nbase], Y[MAX * nbase] ;
    A.transform_2 ( X ) , B.transform_2 ( Y ) ;
    for ( int i = 1; i <= X[0] && i <= Y[0]; ++i )
        X[i] ^= Y[i] ;

    if ( X[0] < Y[0] ) {
        for ( int i = X[0] + 1 ; i <= Y[0] ; ++i )
            X[i] = Y[i] ;
        X[0] = Y[0] ;
    }
    A.transform_210 ( X ) ;
}

void Mare :: radical_cb ( Mare &B ) { // B = sqrt ( A ) ; doar parte intreaga
    Mare cnt, X ;

    for ( cnt = 1; cnt < A; cnt *= 2 ) ;
    for ( B[0] = 1 ; ! cnt.zero () ; cnt /= 2 ) {
        X = cnt, X += B, X *= X ;
        if ( X <= A )
            B += cnt ;
    }
}

void Mare :: afis ( void ) { // afisarea
    printf ( "%d", A[ A[0] ] ) ;
    if (A[0] == 1 && A[1] == 0)
        return ;
    for ( int i = A[0] - 1; i ; --i ) {
        printf ( "%09d", A[i] ) ;
    }
}

int Mare :: toInt ( void ) {
    int aux[55];
    transform_10(aux);
    int res = 0;
    for (int i = aux[0]; i >= 1; --i)
        res = res * 10 + aux[i];
    return res;
}

void Mare :: afis_rad ( int nrzecimale ) { // afisarea radicalului
    int X[MAX * nbase] ;

    A.transform_10 ( X ) ;
    for ( int i = X[0]; i > nrzecimale ; --i )
        printf ( "%d", X[i] ) ;
    printf ( "." ) ;
    for ( int i = nrzecimale ; i ; --i ) {
        printf ( "%d", X[i] ) ;
    }
}

void Mare :: obtain ( int x, int *X ) {
    int S[10] = { 0 } ;
    for ( int i = A[x]; i  ; i /= 10 )
        S[ ++S[0] ] = i % 10 ;
    for ( int i = 1; i <= S[0] ; ++i )
        X[ ++X[0] ] = S[i] ;
    if ( x != A[0] )
        for ( int i = S[0]; i < nbase; ++i )
            X[ ++X[0] ] = 0 ;
}

void Mare :: pow ( int P ) { // A = A^P
    Mare B = 1 ;
    for ( ; P ; P >>= 1 ) {
        if ( P & 1 )
            B *= A ;
        A *= A ;
    }
    A = B ;
}

void Mare :: transform_2 ( int *X ) { // baza 'base' -> baza 2
    Mare B = A ;
    X[0] = 0 ;
    for ( ; !B.zero () ; X[ ++X[0] ] = B[ 1 ] & 1, B /= 2 ) ;
}

void Mare :: transform_10 ( int *X ) { // baza 'base' -> baza 10
    X[0] = 0 ;
    for ( int i = 1; i <= A[0]; ++i )
        obtain ( i, X ) ;
}

void Mare :: transform_210 ( int *X ) { // baza 2 -> baza 'base'
    Mare B = 1 ; A = 0 ;
    for ( int i = 1; i <= X[0]; ++i, B *= 2 ) {
        if ( X[i] == 1 ) A += B ;
    }
}

void Mare :: radical_normal ( Mare &B, int nrzecimale ) {
    int AUX = 0, i , j = 0 ; int X[MAX * nbase] ;
    Mare C, D, E, F, U = 9 , Z = 1 ;

    A.transform_10 ( X ), i = X[0] ;
    X[0] & 1 ? AUX = X[i--] : ( AUX = X[i--], AUX *= 10, AUX += X[i--] ) ;

    int aux = static_cast < int > ( sqrt ( AUX ) ) ;

    B = aux ;

    if ( X[0] > 2 ) {
        AUX -= aux * aux;

        E = AUX, E <<= 1, F = X[i--] ;

        if ( AUX ) E += F, E <<= 1 ;
        else E = F ;

        if ( AUX == 0 && X[i + 1] ) E <<= 1 ;

        F = X[i--], E += F, C = E, F = B, F *= 2, E = F ;

        D = C, D >>= 1, D /= E, U < D ? D = 9 : 0 ;
        E <<= 1, E += D, E *= D ;

        while ( C < E )
            D -= Z, F = B, F *= 2, E = F, E <<= 1, E += D, E *= D ;

        C -= E, B <<= 1, B += D ;
    } else {
        C = AUX - ( aux * aux ) ;
    }

    if ( !C.zero () || i > 0 ) {
        for ( i = i; i > 0 || j < nrzecimale ; ) {
            if ( i > 0 ) {
                E = X[i--], F = 0, F <<= 1, F = E, E = X[i--];
                if ( X[i + 2] ) F <<= 1, F += E ;
                else F = E ;
            } else {
                ++j, F = 0 ;
                if ( j == 1 && C.zero () ) {
                    for ( int i = 1; i <= nrzecimale ; ++i )
                        B <<= 1 ;
                    return ;
                }
            }
            if ( !C.zero () || i == 3 + ( X[0] % 2 == 0 ) && AUX ) {
                C <<= 2, C += F ;
            } else {
                C = F ;
            }

            F = B, F *= 2, E = F ;
            D = C, D >>= 1, D /= E, U < D ? D = 9 : 0 ;
            E <<= 1, E += D, E *= D ;

            while ( C < E )
                D -= Z, F = B, F *= 2, E = F, E <<= 1, E += D, E *= D ;

            C -= E, B <<= 1, B += D ;
        }
    } else {
        for ( int i = 1; i <= nrzecimale ; ++i )
            B <<= 1 ;
    }
}

# undef A

Mare terms[30];
int sign[30];
char e[100100];
int modP[30];

int poz, md;
int factor();
int termen();
int eval();

int factor() {
    if (e[poz] == '+') {
        ++poz;
        return factor();
    }
    if (e[poz] == '-') {
        ++poz;
        return ((long long)-factor() + md) % md;
    }
    if (e[poz] == '[') {
        ++poz;
        int ret = eval();
        ret = (long long)ret * ret % md;
        ++poz;
        return ret;
    }
    if (e[poz] == '(') {
        ++poz;
        int ret = eval();
        ++poz;
        return ret;
    }
    int ret = modP[(int)e[poz] - 'a' + 1];
    ++poz;
    return ret;
}

int termen() {
    int res = factor();
    while (e[poz] == '*') {
        ++poz;
        res = (long long)res * factor() % md;
    }
    return res;
}

int eval() {
    int res = termen();
    while (e[poz] == '+' || e[poz] == '-') {
        if (e[poz] == '+') {
            ++poz;
            res = ((long long)res + termen()) % md;
        } else {
            ++poz;
            res = ((long long)res - termen() + md) % md;
        }
    }
    return res;
}

int fastPow(int A, int B, int modulo) {
    if (B == 0)
        return 1;
    int res = fastPow(A, B / 2, modulo);
    res = (long long)res * res % modulo;
    if (B % 2)
        res = (long long)res * A % modulo;
    return res;
}

int main() {
    freopen("eval.in", "r", stdin);
    freopen("eval.out", "w", stdout);

    srand(time(0));

    scanf("%d\n", &n);
    for (int i = 1; i <= n; ++i) {
        gets(tmp);
        if (tmp[0] == '-') {
            sign[i] = -1;
            //assert(0);
            terms[i] = (tmp + 1);
        } else {
            sign[i] = 1;
            terms[i] = tmp;
        }
    }
    ++n;
    terms[n] = 1;
    for (int i = 1; i <= 1000; ++i)
        terms[n] *= 10;
    sign[n] = 1;
    gets(e + 1);
    int cnt = strlen(e + 1);
    e[++cnt] = '+'; e[++cnt] = (char)('a' + n - 1);

    for (int i = 1; i <= prime_count; ++i) {
        int curPrime;
        do curPrime = 1000000000 + rand() / 2; while (primeMap[curPrime] || isPrime(curPrime) == 0);
        primeMap[curPrime] = 1;
        P[i] = curPrime;
        for (int j = 1; j <= n; ++j) {
            Mare tmp = terms[j];
            tmp %= curPrime;
            modP[j] = tmp.toInt();
            if (sign[j] == -1) {
                modP[j] = curPrime - modP[j];
            }
        }
        poz = 1;
        md = curPrime;
        R[i] = eval();
    }

    Mare M = P[1], res = R[1];
    for (int i = 2; i <= prime_count; ++i) {
        Mare tmp = M;
        tmp %= P[i];
        int smallM = tmp.toInt();
        tmp = res;
        tmp %= P[i];
        int smallRes = tmp.toInt();
        int rem = R[i] - smallRes;
        if (rem < 0)
            rem += P[i];
        int inv = fastPow(smallM, P[i] - 2, P[i]);
        int times = (long long)rem * inv % P[i];
        Mare nextRes = M;
        nextRes *= times;
        nextRes += res;
        res = nextRes;
        M *= P[i];
    }

    if (res >= terms[n]) {
        res -= terms[n];
        res.afis();
    }
    else {
        printf("-");
        Mare tmp = terms[n];
        tmp -= res;
        tmp.afis();
    }

    return 0;
}