#define	_USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <set>
#include <complex>
#include <utility>
#include <numeric>
#define  rep(i,n) for(int i=0;i<(n);i++)
#define  REP(i,a,n) for(int i=a;i<(n);i++)
#define  rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define  VI	vector<int>
#define	 VS vector<string>
#define  all(a) (a).begin(),(a).end()
#define  debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef pair<int,int> P;
typedef long long ll;

const int INF=1000000;
char field[101][101];
int d[101][101];
int N,M;
int sx,sy;
int gx,gy;

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const int MAX_V=100;
const int MAX_N=100;
char o[3]={'+','-','*'};
bool f;
int cal(int a,int b,int k){
	if(k==0)
		return a+b;
	else if(k==1)
		return a-b;
	else
		return a*b;
}

void solve(vector<int>v,int i,int j,int k){
	if(!f)return;
	int a=v[0];
	int b=v[1];
	int c=v[2];
	int d=v[3];
	
	if(cal(cal(cal(a,b,i),c,j),d,k)==10){
	cout<<"((("<<a<<" "<<o[i]<<" "<<b<<")"<<o[j]<<" "<<c<<")"<<o[k]<<" "<<d<<")"<<endl;
	f=false;
		return;
	}
	if(cal(cal(a,b,i),cal(c,d,k),j)==10){
		cout<<"(("<<a<<" "<<o[i]<<" "<<b<<")"<<o[j]<<"("<<c<<" "<<o[k]<<" "<<d<<"))"<<endl;
		f=false;
		return;
	}
	if(cal(cal(a,cal(b,c,j),i),d,k)==10){
		cout<<"(("<<a<<" "<<o[i]<<"("<<b<<" "<<o[j]<<" "<<c<<"))"<<o[k]<<" "<<d<<")"<<endl;
		f=false;
		return;
	}
}

int main(){
	
	int a,b,c,d;
	
	while(cin>>a>>b>>c>>d,a!=0||b!=0||c!=0||d!=0){
		vector<int> v(4);
		 f=true;
		v[0]=a;
		v[1]=b;
		v[2]=c;
		v[3]=d;
		
		sort(v.begin(),v.end());
		do{
			for(int i=0;i<3&&f;i++){
				for(int j=0;j<3&&f;j++){
					for(int k=0;k<3&&f;k++){
						solve(v,i,j,k);
					}
				}
			}
		}while(next_permutation(v.begin(),v.end())&&f);
		if(f)
			cout<<0<<endl;
	}
	

	
}