#include <stdio.h>
//算法2.11
//使用堆栈的顺序存储结构
char Precede(char ch1,char ch2);
int Operate(int m,char ch,int n);
main()
{
    char OPTR[100];
    char OPND[100];
    char c,cpri;
    int i,j;
    i=j=0;
    OPTR[0]='#';
    c=getchar();
    while(c!='#'||OPTR[i]!='#'){
        cpri=c;
        c=getchar();
        if(c=='+'||c=='-'||c=='*'||c=='/'||c=='('||c=='#'||c==')'){
            switch(Precede(c,cpri)){
                case '<':
                    OPTR[++i]=c;
                case '=':
                    OPTR[i]='\0';
                    cpri=OPTR[i--];
//                    c=getchar();
//                    OPTR[++i]=c;
                    break;

                case '>':
                    OPND[j]=Operate(OPND[j-1],c,OPND[j]);
                    break;


            }
        }
        else
            OPND[j++]=c-'0';
    }
    printf("%d",OPND[0]);



}



char Precede(char ch1,char ch2){
    if( (ch1=='+'||ch1=='-'||ch1=='*'||ch1=='/'||ch1=='('||ch1=='#')&&ch2=='('
        ||(ch1=='+'||ch1=='-'||ch1=='('||ch1=='#')&&(ch2=='/'||ch2=='*')
        ||(ch1=='('||ch1=='#')&&(ch2=='+'||ch2=='*') ){
        return '<';
    }
    else if(ch1=='('&&ch2==')'||ch1=='#'&&ch2=='#'){
        return '=';
    }
    else
        return '>';
}


int Operate(int m,char ch,int n){
    switch(ch){
    case '+':
        return m+n;
        break;
    case '-':
        return m-n;
        break;
    case '*':
        return m*n;
        break;
    case '/':
        return m/n;
        break;
    }
}