#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;ll v;//t=0:a number, t=1: otherwise     p:which mo[p] this number shall mod      c:type in [1,m]
    il NUM(){l=r=p=0,v=0ll;}
    il NUM(int l,int r) : l(l),r(r) {}
};
struct OP{
    int l,r,c;
    il OP(){l=r=c=0;}
    il OP(int l,int r) : l(l),r(r) {}
};
int fa[N];pii c[N];
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
il void Union(int x,int y){
    x=find(x),y=find(y);if(x==y) return ;
    fa[y]=x,cmin(c[x].fi,c[y].fi),cmax(c[x].se,c[y].se);
}
il ll solve(int l,int r,int cur){
    if(l>r) return -1;
    if(s[l]=='(' && s[r]==')' && to[l]==r) return solve(l+1,r-1,cur);
    int len,x,y,z,p,q,pre;ll u,v,w;
    vector<NUM> e;vector<OP> f;e.clear(),f.clear();
    x=l,pre=-1;
    for(int i=l;i<=r;++i){
        if(s[i]=='('){
            if(pre==0) return -1;
            e.push_back({i,to[i]});
            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,e.push_back({i,x+1});
        else if(isop(s[x+1])) p=1,f.push_back({i,x+1});
        else return -1;
        i=x+1;if(pre==p) return -1;
        pre=p;
    }
    for(int i=0;i<f.size();++i){
        if(f[i].r!=f[i].l+1 && s[f[i].l]!='0') return -1;
        f[i].c=s[f[i].r-1]-'0';
        if(!f[i].c) return -1;
    }
    if(f.size()!=e.size()-1) return -1;
    if(e.size()==1){
        u=0ll;
        for(int i=e[0].l;i<e[0].r;++i) u=(u*10ll+s[i]-'0')%mo[cur];
        return u;
    }
    for(int i=0;i<f.size();++i) f[i].c=s[f[i].l]-'0';
    len=e.size();
    for(int i=0;i<e.size();++i) e[i].p=cur,fa[i+1]=i+1,c[i]={i+1,i+1};
    //按优先级从小到大的合并，倒退出该模什么
    for(int j=1;j<=m;++j){
        for(int i=0;i<len-1;++i){
            if(f[i].c!=j) continue;
            x=i;while(x<len-2 && f[x+1].c==j) ++x;
            
        }
    }
    return 0ll;
}
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;
        }
    }
    ans=solve(1,n,0);
    if(ans==-1) RET
    else printf("%lld",ans);
    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.)))
*/