#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
int a[4];
string op ="+-*";

int cal(int x,int y,int c){
  switch(c){
  case 0:
    return x+y;
  case 1:
    return x-y;
  case 2:
    return x*y;
  }
}

int main()
{
  while(cin>>a[0]>>a[1]>>a[2]>>a[3],a[0]||a[1]||a[2]||a[3]){
    sort(a,a+4);
    bool flag = true;
    do{
      for(int i = 0;i < 3;i++){//演算子は3*3*3通り
	for(int j = 0;j < 3;j++){
	  for(int k = 0;k < 3;k++){
	    if( cal(cal(cal(a[0],a[1],i),a[2],j),a[3],k) ==10){
	      cout <<"(("<<a[0]<<" "<<op[i]<<" "<<a[1]<<")"<<" "<<op[j]<<" "<<a[2]<<")"<<" "<<op[k]<<" "<<a[3]<<endl;
	      flag = false;
	      i = j = k = 3;
	      break;
	    }
	    if( cal(a[3],(cal(a[0],cal(a[1],a[2],j),i)),k) == 10){
	      cout <<"("<<a[0]<<" "<<op[i]<<"("<<a[1]<<" "<<op[j]<<" "<<a[2]<<"))"<<" "<<op[k]<<" "<<a[3]<<endl;
	      flag = false;
	      i = j = k = 3;
	      break;
	    }
	    if( cal(cal(a[0],a[1],i),cal(a[2],a[3],k),j) ==10){
	      cout <<"("<<a[0]<<" "<<op[i]<<" "<<a[1]<<") "<<op[j]<<" ("<<a[2]<<" "<<op[k]<<" "<<a[3]<<")"<<endl;
	      flag = false;
	      i = j= k= 3;
	      break;
	    }if( cal(a[0],cal(cal(a[1],a[2],j),a[3],k),i) ==10){
	      cout <<a[0]<<" "<<op[i]<<" "<<"(("<<a[1]<<" "<<op[j]<<" "<<a[2]<<") "<<op[k]<<" "<<a[3]<<")"<<endl;
	      flag =false;
	      i = j = k = 3;
	      break;
	    }
	    if( cal(a[0],cal(a[1],cal(a[2],a[3],k),j),i) ==10){
	      cout <<a[0]<<" "<<op[i]<<" "<<"("<<a[1]<<" "<<op[j]<<" ("<<a[2]<<" "<<op[k]<<" "<<a[3]<<"))"<<endl;
	      flag = false;
	      i = j = k = 3;
	      break;
	    }
	  }
	}
      }
    }while(next_permutation(a,a+4)&&flag);
    if(flag){
      cout <<0<<endl;
    }
  }
  return 0;
}