func_code_string: #include <bits/stdc++.h>   using namespace std;   long long qpow(long long a, long long b) {     long long ans = 1;     while (b) {       if (b % 2) ans = ans * a;       a = a * a;       b = b / 2;     }     return ans;   }   vector<int> pos;   stack<long long> num;   stack<char> ch;   long long cal(string s) {     while (!num.empty()) num.pop();     while (!ch.empty()) ch.pop();     for (int i = 0; i < s.length(); i++) {       char c = s[i];       if (c >=  0  && c <=  9 )         num.push(c -  0 );       else if (c ==  ( ) {         ch.push(c);       } else if (c ==  ) ) {         while (ch.top() !=  ( ) {           char x = ch.top();           ch.pop();           long long a = num.top();           num.pop();           long long b = num.top();           num.pop();           if (x ==  * )             num.push(a * b);           else             num.push(a + b);         }         ch.pop();       } else {         if (c ==  + ) {           while (!ch.empty() && ch.top() ==  * ) {             char x = ch.top();             ch.pop();             long long a = num.top();             num.pop();             long long b = num.top();             num.pop();             if (x ==  * )               num.push(a * b);             else               num.push(a + b);           }           ch.push(c);         } else           ch.push(c);       }     }     while (!ch.empty()) {       char x = ch.top();       ch.pop();       long long a = num.top();       num.pop();       long long b = num.top();       num.pop();       if (x ==  * )         num.push(a * b);       else         num.push(a + b);     }     return num.top();   }   int main() {     ios::sync_with_stdio(false);     string str;     while (cin >> str) {       int n = str.size();       pos.clear();       pos.push_back(-1);       for (int i = 1; i < n; i += 2) {         if (str[i] ==  * ) {           pos.push_back(i);         }       }       pos.push_back(n);       int len = pos.size();       long long ans = 0;       for (int i = 0; i < len - 1; i++) {         for (int j = i + 1; j < len; j++) {           string s = str;           s.insert(pos[i] + 1, 1,  ( );           s.insert(pos[j] + 1, 1,  ) );           ans = max(ans, cal(s));         }       }       cout << ans << endl;     }   }   