#include <bits/stdc++.h>
#define il inline
#define pii pair<int,int>
#define fi first
#define se second
#define RET {printf("error");exit(0);}
using namespace std;
typedef long long ll;
il ll qp(ll a,ll b,ll mod){
    ll ans=1ll;
    while(b){
        if(b&1) ans=(ans*a)%mod;
        a=(a*a)%mod,b>>=1;
    }return ans;
}
il ll getphi(ll x){
    ll ret=x,y,z;
    for(ll i=2;i*i<=x;++i){
        if(x%i) continue;
        while(x%i==0) x/=i;
        ret=(ret*(i-1ll))/i;
    }
    if(x>1) ret=(ret*(x-1ll))/x;
    return ret;
}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
il bool isch(char c){return (c>='0' && c<='9') || c=='.' || c=='+' || c=='*' || c=='^' || c=='(' || c==')';}
il bool isop(char c){return c=='.' || c=='+' || c=='*' || c=='^';}
il void cmin(int &x,int y){x=x<y?x:y;}
il void cmax(int &x,int y){x=x>y?x:y;}
const int N=10005,M=15;const ll mod=998244353;
int n,m,k,to[N];char s[N],op[M];ll mo[N];
il void init(){
    mo[0]=mod;
    for(int i=1;;++i){
        mo[i]=getphi(mo[i-1]);
        if(mo[i]==1){k=i;break;}
    }
    for(int i=k+1;i<N;++i) mo[i]=1;
}
struct NUM{
    int l,r,p,ls,rs;ll v,w;//t=0:a number, t=1: otherwise     p:which mo[p] this number shall mod      c:type in [1,m]
    //v:value mod mo[p] ,w:if(value<=mod) w=value;else w=-1
    il NUM(){l=r=ls=rs=p=0,v=w=0ll;}
    il NUM(int l,int r) : l(l),r(r) {}
}a[N<<1];int tot,rt;
il ll dfs(int l,int r){
    if(l>r) return -1;
    if(s[l]=='(' && s[r]==')' && to[l]==r) return dfs(l+1,r-1);
    int len,x,y,z,p,q,pre;ll u,v,w;
    x=l,pre=-1;pii cc={0,0},opt={0,0};
    for(int i=l;i<=r;++i){
        if(s[i]=='('){
            if(pre==0) return -1;
            cc={i+1,to[i]-1},i=to[i],pre=0;continue;
        }
        if(!isdigit(s[i])) return -1;
        x=i;
        while(x<r && isdigit(s[x+1])) ++x;
        if(x>=r || !isop(s[x+1])) return -1;
        if(s[x+1]=='.') p=0;
        else if(isop(s[x+1])) p=1;
        else return -1;
        if(pre==p || (!cc.fi && p)) return -1;
        if(!cc.fi) cc={i,x+1};
        else{opt={i,x+1};break;}
        pre=p,i=x+1;
    }
    if(opt.fi){
        if(opt.se!=opt.fi+1){for(int i=opt.fi;i<=opt.se-2;++i) if(s[i]!='0') return -1;}
        if(s[opt.se-1]=='0') return -1;
    }
    a[++tot]=NUM(l,r);int ID=tot;
    if(cc.se<r) a[tot].ls=dfs(cc.fi,cc.se);
    if(opt.se) a[tot].rs=dfs(opt.se+1,r);
    if(a[tot].ls==-1 || a[tot].rs==-1) return -1;
    return ID;
}
void solve(int x,int cur){
    a[x].p=cur;
    if(!a[x].ls && !a[x].rs){
        
    }
}
ll ans;int st[N],top;
int main(){
    scanf("%d%s%s",&m,op+1,s+1);init();n=strlen(s+1);
    for(int i=1;i<=n;++i){
        if(s[i]=='(') st[++top]=i;
        else if(s[i]==')'){
            if(!top) RET
            to[i]=st[top],to[st[top]]=i,--top;
        }
    }
    rt=dfs(1,n);
    if(rt==-1) RET
    solve(1,0);
    printf("%lld",a[1].v);
    return 0;
}
/*
2
01
1.2+2.1^3.2*4.2^(5.2*6.)2+7.
1 2
3 4
5 6
7 8
9 10
11 12
13 14
15 16
17 24
25 26
27 28

((((002.001+003.)001*004.001+(((005.))))))

(002.001+003.)001*004.001+(((005.)))

(002.001+003.)001*004.001+(((005.)))
*/