#include<cstdio>
#define N 105
using namespace std;
int n,a[N],l[N],r[N];char s[N],c[5];bool b[N];
int dfs(int u)
{
    if(u>=1&&u<=n)return a[u];
    int a=dfs(l[u]),b=dfs(r[u]),sum;
    switch(s[u])
    {
        case'+':sum=a+b;break;
        case'-':sum=a-b;break;
        case'*':sum=a*b;break;
        case'/':sum=a/b;break;
    }
    return sum;
}
int main()
{
    freopen("expr_tree.in","r",stdin);freopen("expr_tree.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",a+i);
    for(int i=n+1;i<2*n;i++)scanf("%s%d%d",c,l+i,r+i),s[i]=c[0],b[l[i]]=b[r[i]]=1;
    for(int i=n+1;i<2*n;i++)if(!b[i])printf("%d",dfs(i));
    return 0;
}