import java.util.Scanner;

public class bdsqz {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String  jisuan =  scanner.next();
        zhan num = new zhan(100000);
        zhan fuhao = new zhan(100000);
        int index = 0;//数组编号
        int num1 = 0;//数字一
        int num2 = 0;//数字二
        int oper = 0;//符号
        int res = 0;//保存
        char zf = ' ';//将每次扫描的字符扫描
        String keepnum = "";//拼接多位数
        while (true) {
            zf = jisuan.substring(index, index + 1).charAt(0);
            if (zf == '+' || zf == '*') {//如果是运算符
                if (!fuhao.iskong()) {
                    //如果符号栈有操作符，就进行比较，如果当前的操作符的优先级小于或者等于栈中的操作符，就需要从数栈中pop出两个数，
                    // 在从符号栈中POP出一个符号，进行运算，将得到结果，入数栈，然后将当前的操作符入符号栈
                    if (fuhao.pdfh(zf) <= fuhao.pdfh(fuhao.peek())) {
                        num1 = num.pop();
                        num2 = num.pop();
                        oper = fuhao.pop();
                        res = num.cal(num1, num2, oper);
                        //结果入数栈
                        num.push(res);
                        //当前符号入符号栈
                        fuhao.push(zf);
                    } else {
                        //如果当前符号大于运算符号，则直接入符号栈
                        fuhao.push(zf);
                    }
                } else {
                    //如果成功直接入栈。
                    fuhao.push(zf);
                }
            } else {
                //当数字为两位时不好判断
                keepnum += zf;
                if (index == jisuan.length() - 1) {
                    num.push(Integer.parseInt(keepnum));
                } else {
                    if (jisuan.substring(index + 1, index + 2).charAt(0) == '*' || jisuan.substring(index + 1, index + 2).charAt(0) == '+') {
                        num.push(Integer.parseInt(keepnum));//入栈
                        keepnum = "";
                    }
                }
            }
            index++;
            if (index >= jisuan.length()) {
                break;
            }
        }
        while (true){
            if (fuhao.iskong()){
                break;
            }
            num1 = num.pop();
            num2 = num.pop();
            oper = fuhao.pop();
            res = num.cal(num1,num2,oper);
            //结果入数栈
            num.push(res);

        }
        System.out.println(num.pop()%10000);
    }
            static class zhan {
                private int maxzhan;//栈的大小
                private int zhana[];//定义了一个栈
                private int zhantop = -1;//目前栈的位置

                public zhan(int maxzhan) {
                    this.maxzhan = maxzhan;
                    zhana = new int[maxzhan];
                }
                //判断是否有数值
                public boolean iskong() {
                    return zhantop == -1;
                }
                public void push(int value) {
                    zhantop++;
                    zhana[zhantop] = value;
                }
                public int peek(){
                    return zhana[zhantop];
                }
                public int pop() {
                    int value = zhana[zhantop];
                    zhantop--;
                    return value;
                }
                //判断是否为运算符
                public int pdfh(int oper) {
                    if (oper == '*') {
                        return 1;
                    } else {
                        return 0;
                    }
                }
                public int cal(int num1, int num2, int oper) {
                    int res = 0;//存放计算结果
                    switch (oper){
                        case '+':
                            res = num1+num2;
                            break;
                        case'*':
                            res =num1*num2;
                            break;
                    }
                    return res;
                }
            }
        }