#include<bits/stdc++.h>
using namespace std;
const int M[30]={998244353,998244352,402653184,134217728,67108864,33554432,16777216,8388608,4194304,2097152,1048576,524288,262144,131072,65536,32768,16384,8192,4096,2048,1024,512,256,128,64,32,16,8,4,2};
int n,m,mc[10010],stk[10010],tp;
bool fg[10];
char str[10010];
struct node
{
	int v;
	bool c;
};
inline int mod(int x)
{
	return x>29?1:M[x];
}
inline node pw(int a,int b,int m)
{
	//printf("G%d %d %d\n",a,b,m);
	int res=1;
	long long A=a,tmp=1;
	for(;b;b>>=1)
	{
		if(b&1)
		{
			if(~tmp)
			{
				tmp=1ll*tmp*a;
				if(tmp>M[0])
					tmp=-1;
			}
			res=1ll*res*a%m;
		}
		a=1ll*a*a%m;
		if(~tmp)
		{
			A=A*A;
			if(A>M[0])
				tmp=-1;
		}
	}
	return {res,tmp==-1};
}
node calc(int l,int r,int c)
{
	if(mc[l]==r)
		return calc(l+1,r-1,c);
	int pos=l;
	bool Fg=1,tmp=0;
	tp=0;
	while(pos<=r)
	{
		Fg^=1;
		if(mc[pos])
		{
			pos=mc[pos]+1;
			continue;
		}
		if(Fg)
		{
			while(str[pos]=='0') 
				pos++;
			if(str[pos]<'1'||str[pos]>'9')
			{
				puts("error");
				exit(0);
			}
			while(tp&&str[stk[tp]]>str[pos])
				tp--;
			stk[++tp]=pos;
			pos++;
		}
		else
		{
			tmp=1;
			while(pos<=n+1&&str[pos]!='.')
				pos++;
			if(pos>r)
			{
				puts("error");
				exit(0);
			}
		}
		pos++;
	}
	if(!tp)
	{
		if(!tmp)
		{
			puts("error");
			exit(0);
		}
		node res={0,0};
		int Pos=r;
		for(int i=l;i<r;i++)
		{
			if(Pos==r&&str[i]-'0')
				Pos=i;
			res.v=(10ll*res.v+str[i]-'0')%mod(c);
		}
		if(r-Pos>9)
			res.c=1;
//		printf("%d %d %d %d\n",l,r,res.v,res.c);
		return res;
	}
	int mid=stk[1],col=str[mid];
	if(!fg[str[mid]-'0'])
		for(int i=2;i<=tp&&str[stk[i]]==col;i++)
			mid=stk[i];
	int tmid=mid-1;
	while(str[tmid]=='0')
		tmid--;
	node a=calc(l,tmid,c),b=calc(mid+2,r,c+(str[mid+1]=='^')),res={0,0};
	if(str[mid+1]=='+')
	{
		res.c=a.c|b.c|(a.v+b.v>=mod(0));
		res.v=(a.v+b.v)%mod(c);
	}
	else if(str[mid+1]=='*')
	{
		res.c=a.c|b.c|(1ll*a.v*b.v>=mod(0));
		res.v=1ll*a.v*b.v%mod(c);
	}
	else
	{
		res=pw(a.v,b.v+(b.c?mod(c+1):0),mod(c));
		res.c|=a.c;
	}
//	printf("%d %d %d %d\n",l,r,res.v,res.c);
	return res;
}
int main()
{
//	freopen("w.in","r",stdin);
//	freopen("w.out","w",stdout);
	scanf("%d",&m);
	for(int i=1;i<=m;i++)
		scanf("%1d",&fg[i]);
	scanf("%s",str+1);
	n=strlen(str+1);
	for(int i=1;i<=n;i++)
	{
		if(str[i]==')')
		{
			if(!tp)
			{
				puts("error");
				return 0;
			}
			mc[stk[tp--]]=i;
		}
		if(str[i]=='(')
			stk[++tp]=i;
	}
	printf("%d",calc(1,n,0).v);
	return 0;
}