#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 OP{
    int l,r,c;
    il OP(){l=r=c=0;}
    il OP(int l,int r) : l(l),r(r) {}
};
struct node{
    int l,r,p,ls,rs;ll v,w;char op;//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 node(){l=r=ls=rs=p=0,v=w=0ll;}
    il node(int l,int r) : l(l),r(r) {}
}a[N<<1];int tot,rt;
il int 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;
    vector<OP> f;f.clear();
    x=l,pre=-1;
    for(int i=l;i<=r;++i){
        if(s[i]=='('){
            if(pre==0) return -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,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;
    }
    int mi=n+1;for(int i=0;i<f.size();++i) mi=min(mi,f[i].c);
    if(op[mi]=='0'){p=-1;for(int i=0;i<f.size();++i)if(f[i].c==mi && i>p) p=i;}
    else{p=-1;for(int i=0;i<f.size();++i)if(f[i].c==mi){p=i;break;}}
    a[++tot]=node(l,r);int ID=tot;if(p!=-1) a[ID].op=s[f[p].r];else a[ID].op='a';
    a[ID].ls=a[ID].rs=0;
    if(p!=-1) a[ID].ls=dfs(l,f[p].l-1),a[ID].rs=dfs(f[p].r+1,r);
    if(a[ID].ls==-1 || a[ID].rs==-1) return -1;
    //printf("%d %d %d\n",ID,a[ID].ls,a[ID].rs);
    //if(p!=-1) printf("%d %d %d %d\n",l,r,f[p].l,f[p].r);
    return ID;
}
void solve(int x,int cur){
    a[x].p=cur;//printf("%d %d %d %d\n",x,cur,a[x].ls,a[x].rs);
    if(!a[x].ls && !a[x].rs){
        ll u=0ll,v=0ll;
        for(int i=a[x].l;i<a[x].r;++i) u=(u*10ll+s[i]-'0')%mo[cur];
        for(int i=a[x].l;i<a[x].r;++i){v=(v*10ll+s[i]-'0');if(v>mod) {v=-1;break;}}
        a[x].v=u,a[x].w=v;
        //printf("*** %d %d %d %d %lld %lld\n",x,a[x].l,a[x].r,cur,a[x].v,a[x].w);
        return ;
    }
    int y=a[x].ls,z=a[x].rs;
    if(a[x].op=='+'){
        solve(y,cur),solve(z,cur),a[x].v=(a[y].v+a[z].v)%mo[cur];
        if(a[y].w==-1 || a[z].w==-1) a[x].w=-1;
        else{
            a[x].w=a[y].w+a[z].w;
            if(a[x].w>mod) a[x].w=-1;
        }
        //printf("*** %d %d %d %d %lld %lld\n",x,a[x].l,a[x].r,cur,a[x].v,a[x].w);
        return ;
    }
    if(a[x].op=='*'){
        solve(y,cur),solve(z,cur),a[x].v=(a[y].v*a[z].v)%mo[cur];
        if(a[y].w==-1 || a[z].w==-1) a[x].w=-1;
        else{
            a[x].w=a[y].w*a[z].w;
            if(a[x].w>mod) a[x].w=-1;
        }
        //printf("*** %d %d %d %d %lld %lld\n",x,a[x].l,a[x].r,cur,a[x].v,a[x].w);
        return ;
    }
    solve(y,cur),solve(z,cur+1);
    if(a[z].w==-1){
        a[x].v=qp(a[y].v,a[z].v+mo[cur+1],mo[cur]);
        if(a[y].w!=-1 && (a[y].w>=0 && a[y].w<=1)) a[x].w=a[y].w;
        else a[x].w=-1;
        //printf("*** %d %d %d %d %lld %lld\n",x,a[x].l,a[x].r,cur,a[x].v,a[x].w);
        return ;
    }
    a[x].v=qp(a[y].v,a[z].w,mo[cur]);
    if(a[y].w==-1){a[x].w=-1;return ;}
    if(a[y].w>=0 && a[y].w<=1){
        if(!a[z].w) a[x].w=1;
        else a[x].w=a[y].w;
        return ;
    }
    a[x].w=1ll;
    for(ll i=1;i<=a[z].w;++i){
        a[x].w*=a[y].w;
        if(a[x].w>mod){a[x].w=-1;break;}
    }
    //printf("*** %d %d %d %d %lld %lld\n",x,a[x].l,a[x].r,cur,a[x].v,a[x].w);
}
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(rt,0);
    printf("%lld",a[rt].v);
    return 0;
}
/*
2
01
1.2+2.1^3.2*4.2^(5.2*6.)2+7.

2
01
1.2+2.1^3.2*4.2^(5.2*6.)2+7.
*/