get a 100

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <ctime>
#include <numeric>
#include <random>

#define int long long

using namespace std;

void solve() {
    string s;
    cin >> s;
    vector<vector<vector<pair<string, long double>>>> dp(5, vector<vector<pair<string, long double>>> (5));
    for (int l = 1; l <= 5; ++l) {
        for (int i = 0; i <= 5 - l; ++i) {
            if (!(stoi(s.substr(i, l)) == 0 && l >= 2)) {
                dp[i][i + l - 1].emplace_back("(" + s.substr(i, l) + ")", stold(s.substr(i, l)));
                dp[i][i + l - 1].emplace_back("(-" + s.substr(i, l) + ")", -stold(s.substr(i, l)));
            }
            for (int j = i + 1; j <= i + l - 1; ++j) {
                for (auto [str1, res1] : dp[i][j - 1]) {
                    for (auto [str2, res2] : dp[j][i + l - 1]) {
                        dp[i][i + l - 1].emplace_back("(" + str1 + "+" + str2 + ")", res1 + res2);
                        dp[i][i + l - 1].emplace_back("(" + str1 + "-" + str2 + ")", res1 - res2);
                        dp[i][i + l - 1].emplace_back("(" + str1 + "*" + str2 + ")", res1 * res2);
                        if (fabs(res2) > 1e-6) {
                            dp[i][i + l - 1].emplace_back("(" + str1 + "/" + str2 + ")", res1 / res2);
                        }
                    }
                }
            }
//            cerr << i << ' ' << i + l - 1 << '\n';
//            for (auto [str, res] : dp[i][i + l - 1]) {
//                cerr << str << ' ' << res << '\n';
//            }
//            cerr << "===\n";
        }
    }
    for (auto [str, res] : dp[0][4]) {
        if (fabs(res - 100) < 1e-6) {
            cout << str << '\n';
            return;
        }
    }
    cout << "-1\n";
}

int32_t main() {
#ifdef DDD
    freopen("input.txt", "r", stdin);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#endif


    solve();
}