求助！！！在法1上改的

/*#include<bits/stdc++.h>
using namespace std;
const int n=10000;
int x,s,t;
char c;
int main(){
    cin>>t;
    while(cin>>c&&c!='\n'){ 
        cin>>x;
        if(c=='*')
            t=t*x%n;
        else
            s=(s+t)%n,t=x;
    }
    cout<<(s+t)%n<<"\n"; 
    return 0;
}*/
#include<bits/stdc++.h>
using namespace std;
struct s{
	//int N=5;
	int buf[1000];
	int top=0;
	void push(int x){
		top++;
		buf[top]=x;
	}
	void pop(){
		top=0;
	}
	void clear(){
		top=0;
	}
	bool empty(){
		if(top==0)
			return 1;
		else
			return 0;
	}
};
const int n=10000;
int x,s,t;
char c;
int main(){
    s a;
    cin>>t;
    a.push(t);
    while(cin>>c&&c!='\n'){ 
        cin>>x;
        a.push(x);
        if(c=='*'){
            a.pop();
            t=t*x%n;
        }
        else{
            a.pop();
            s=(s+t)%n,t=x;
        }
    }
    cout<<(s+t)%n<<"\n"; 
    return 0;
}