#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using VC = vector<char>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

// 構文解析セット
// 参考 https://gist.github.com/draftcode/1357281
struct MyParser{
    typedef string::const_iterator State;
    class ParseError {};

    // 外からはこれを使う
    ll parse(string s){
        State it = s.begin();
        ll ans = expression(it);
        return ans;
    }
    ll number(State &begin) {
        ll ret = 0;
        while (isdigit(*begin)) {
            ret *= 10;
            ret += *begin - '0';
            begin++;
        }
        return ret;
    }
    ll factor(State &begin) {
        if (*begin == '(') {
            begin++; // '('を飛ばす。
            ll ret = expression(begin);
            begin++; // ')'を飛ばす。
            return ret;
        } else {
            return number(begin);
        }
    }
    ll term(State &begin) {
        ll ret = factor(begin);
        for (;;) {
            if (*begin == '*') {
                begin++;
                ret *= factor(begin);
            } else if (*begin == '/') {
                begin++;
                ret /= factor(begin);
            } else {
                break;
            }
        }
        return ret;
    }
    ll expression(State &begin) {
        ll ret = term(begin);
        for (;;) {
            if (*begin == '+') {
                begin++;
                ret += term(begin);
            } else if (*begin == '-') {
                begin++;
                ret -= term(begin);
            } else {
                break;
            }
        }
        return ret;
    }
};
// 構文解析セットおわり

string ops = "+-*";

void insert(string& s, VC& nums, VC& operators){
  // num
  s[2]=nums[0];
  s[6]=nums[1];
  s[11]=nums[2];
  s[16]=nums[3];
  // ops
  s[4]=operators[0];
  s[9]=operators[1];
  s[14]=operators[2];

  // 空白除去
  stringstream ss;
  for(char c : s){
    if(c!=' ') ss<<c;
  }
  s = ss.str();
}

VS f(VI V){
  VC C;
  for(ll v : V){
    char c = '0' + v;
    C.push_back(c);
  }

  VS ret;
  // 演算子全探索
  rep(i, 3){
    rep(j, 3){
      rep(k, 3){
        vector<char> operators = {ops[i], ops[j], ops[k]};

        string s;
        s = "( x . x) .(x  . x)";
        insert(s, C, operators); ret.push_back(s);

        s = "((x . x) . x) . x ";
        insert(s, C, operators); ret.push_back(s);
        
        s = "( x .(x  . x)). x";
        insert(s, C, operators); ret.push_back(s);
      }
    }
  }
  return ret;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll a,b,c,d;

    MyParser par;

    while(cin>>a>>b>>c>>d){
      if(a==0) return 0;
      VI V = {a,b,c,d};
      SORT(V);
      do{
        VS lst = f(V);
        for(string s : lst){
          ll v = par.parse(s);
          debug(s, v);
          if(v==10){
            p(s);
            goto HERE;
          }
        }
      }while(next_permutation(ALL(V)));
      p(0);
HERE:
      ll a = 123;
    }   
    return 0;
}


Measured memory_bytes: 3224