#include <bits/stdc++.h>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi  = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;

string S;
int cur=0;

int factor();
int expression();

int factor(){
	if(isdigit(S[cur])){
		return S[cur++]-'0';
	}else if(S[cur]=='('){
		cur++;
		int num=expression();
		assert(S[cur]==')');
		cur++;
		return num;
	}
	return 0;
}

int expression(){
	int a=factor(),b;
	switch(S[cur]){
		case '+':
			cur++;
			b=factor();
			a+=b;
			break;
		case '-':
			cur++;
			b=factor();
			a-=b;
			break;
		case '*':
			cur++;
			b=factor();
			a*=b;
			break;
	}
	return a;
}

int eval(string e){
	S=e;
	cur=0;
	return expression();
}

string base_exp[5]={
	"(((a,b),c),d)",
	"((a,(b,c)),d)",
	"(a,(b,(c,d)))",
	"(a,((b,c),d))",
	"((a,b),(c,d))"
};

char op[3]={'+','-','*'};

int main(void){
	int num[4];
	while(1){
		rep(i,4) cin >> num[i];
		if(num[0]==0) break;
		sort(num,num+4);
		string ans="";
		do{
			rep(a,5)rep(b,3)rep(c,3)rep(d,3){
				string base=base_exp[a];
				rep(i,base.size()){
					if(islower(base[i]))
						base[i]=num[base[i]-'a']+'0';
				}
				rep(i,base.size()) if(base[i]==','){ base[i]=op[b];break;}
				rep(i,base.size()) if(base[i]==','){ base[i]=op[c];break;}
				rep(i,base.size()) if(base[i]==','){ base[i]=op[d];break;}
				if(eval(base)==10)
					ans=base;
			}
		}while(next_permutation(num,num+4));
		if(ans=="")
			cout << 0 << endl;
		else
			cout << ans << endl;
	}
	return 0;
}