//\
1425.表达式求值\
g++ 1425.表达式求值.cpp -O2 -g -D LOCAL -D debug

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;

#define is_num(tmp) (tmp<='9' and tmp>='0')
#define BASE 10000

inline int Get_line(char *s){
	char tmp=getchar();
	int len=0;
	memset(s, 0, sizeof(s));
	while(!(is_num(tmp)||tmp=='+'||tmp=='*'))tmp=getchar();
	while(is_num(tmp)||tmp=='+'||tmp=='*')
		s[len++]=tmp, tmp=getchar();
	return len;
}

char s[2000000];
int num[200000], N, len;
int stack_1[200000], top_1;
int stack_2[200000], top_2;
int f[200000], f_N;

int main(){
#ifndef LOCAL
	freopen("expr2013.in", "r", stdin);
	freopen("expr2013.out", "w", stdout);
#endif

	len=Get_line(s);
	
	for(int i=0; i<len; ++i){
		if(is_num(s[i])){
			do{
				num[N]=(num[N]<<1)+(num[N]<<3)+(s[i]^48);
				++i;
			}while(is_num(s[i]));
			++N;
		}
		if(s[i]=='+')f[f_N++]=1;
		else if(s[i]=='*')f[f_N++]=2;
	}
#ifdef debug
	for(int i=0; i<N; ++i){
		cout<<num[i]<<' ';
	}
	cout<<'\n';
	for(int i=0; i<f_N; ++i){
		cout<<f[i]<<' ';
	}
#endif
	
	stack_1[top_1++]=num[0];
	int i=1, j=0;
	do{
		stack_2[top_2++]=f[j++];
		stack_1[top_1++]=num[i++];
		
		if(stack_2[top_2-1]==2){
			--top_2;
			--top_1;
			stack_1[top_1-1]=(stack_1[top_1]%BASE)*(stack_1[top_1-1]%BASE)%BASE;
		}
	}while(j<=f_N);
	
	while(top_1>1){
		--top_1;
		stack_1[top_1-1]=((stack_1[top_1]%BASE)+(stack_1[top_1-1]%BASE))%BASE;
	}
	
	printf("%d", stack_1[0]);
	
	return 0;
}