1
#include <bits/stdc++.h>
2
#define endl '\n'
3
using namespace std;
4
typedef long long ll;
5
ll power(char a){
6
    if(a=='+'||a=='-')return 1;
7
    if(a=='*'||a=='/')return 2;
8
    if(a=='^')return 3;
9
    return 0;
10
}
11
bool isop(string it){
12
    if(it.size()==1&&string{"+-*/^"}.find(it[0])!=string::npos)return true;
13
    return false;
14
}
15
ll kua(ll a,ll b){
16
    ll ans=1;
17
    while(b){
18
        if(b%2)ans*=a;
19
        b/=2;
20
        a*=a;
21
    }
22
    return ans;
23
}
24
ll ca(ll a,ll b,char c){
25
    if(c=='+')return b+a;
26
    if(c=='-')return b-a;
27
    if(c=='*')return b*a;
28
    if(c=='/')return b/a;
29
    if(c=='^')return kua(b,a);
30
}
31
int main(){
32
    string str;
33
    cin>>str;
34
    vector<string> dq;
35
    deque<char> cal;
36
    for(ll i=0;i<str.size();){
37
        char cnt=str[i];
38
        if('0'<=cnt&&cnt<='9'){
39
            string num;
40
            while(i<str.size()&&('0'<=str[i]&&str[i]<='9'))
41
                num+=str[i++];
42
            dq.push_back(num);
43
            continue;
44
        }else if(cnt=='('){
45
            cal.push_back('(');
46
        }else if(cnt==')'){
47
            while(!cal.empty()&&cal.back()!='('){
48
                string tran=string(1,cal.back());
49
                dq.push_back(tran);
50
                cal.pop_back();
51
            }
52
            if(!cal.empty())cal.pop_back();
53
        }else{
54
            while(!cal.empty()&&cal.back()!='('){
55
                if(power(cnt)<=power(cal.back())&&cnt!='^'){
56
                    dq.push_back(string(1,cal.back()));
57
                    cal.pop_back();
58
                }else break;
59
            }
60
            cal.push_back(cnt);
61
        }
62
        i++;
63
    }
64
    while(!cal.empty()){
65
        dq.push_back(string(1,cal.back()));
66
        cal.pop_back();
67
    }
68
    for(ll i=0;i<dq.size();i++){
69
        if(i!=0)cout<<' ';
70
        cout<<dq[i];
71
    }
72
    cout<<endl;
73
    while(dq.size()>1){
74
        for(ll j=0;j<dq.size();j++){
75
            if(isop(dq[j])){
76
                ll a=stoll(dq[j-1]);
77
                ll b=stoll(dq[j-2]);
78
                ll op=dq[j][0];
79
                dq.erase(dq.begin()+j-2,dq.begin()+j+1);
80
                dq.insert(dq.begin()+j-2,to_string(ca(a,b,op)));
81
                break;
82
            }
83
        }
84
        for(ll j=0;j<dq.size();j++){
85
            if(j!=0)cout<<' ';
86
            cout<<dq[j];
87
        }
88
        cout<<endl;
89
    }
90
    return 0;
91
}