#include<iostream>
#include<cstring>
#include<algorithm> 
#include<stack>
using namespace std;
 
stack<char> s1; //運算符棧 
stack<char> s2; //中間結果棧 
 
int f(const char str){
 int yxj; //優(yōu)先級 
 switch(str){
 case '*':yxj=5;break;
 case '/':yxj=5;break;
 case '+':yxj=4;break;
 case '-':yxj=4;break;
 }
 return yxj;
 
}
int main(){
 char c[100]="(12+4-13)+6*2";
 //char c[100]="1+((2+3)*4)-5";
 int lenc=strlen(c);
 //讀取字符串 
 for(int i=0;i<lenc;i++){
 if(c[i]>='0'&&c[i]<='9'){ //如果是數(shù)字，直接壓入s2 
 s2.push(c[i]);
 }else if(c[i]=='+'||c[i]=='-'||c[i]=='*'||c[i]=='/'){ //如果是運算符 
 while(true){
 if(s1.empty()||s1.top()=='('){ //s1為空 ，或者棧頂為( 
 s1.push(c[i]);
 break;
 }else if(f(c[i])>f(s1.top())){ //當前運算符優(yōu)先級大于s1棧頂運算符優(yōu)先級 
 s1.push(c[i]);
 break;
 }
 else{ //小于等于 
 char cc=s1.top();
 s1.pop();
 s2.push(cc);
 }
 }
 }else{
 if(c[i]=='('){ //直接讀入 
 s1.push(c[i]);
 }else{
 while(s1.top()!='('){
 char ccc=s1.top();
 s1.pop();
 s2.push(ccc);
 }
 s1.pop();
 }
 }
 }
 while(!s1.empty()){
 char cccc=s1.top();
 s2.push(cccc);
 s1.pop();
 }
 
 //while(!s2.empty()){ //結果是逆序的 
 // cout<<s2.top();
 // s2.pop();
 //}
 while(!s2.empty()){
 char c=s2.top();
 s1.push(c);
 s2.pop();
 }
 while(!s1.empty()){ 
 cout<<s1.top();
 s1.pop();
 }
 
 return 0;
}