#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<list>
#include<stack>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;

bool ansflag;

int Calc(int p,int num[4],int op[3],int pr[3]){
	int np,npr;

	int b = num[p+1];
	npr = 3;
	for(int i=p+1;i<3 && pr[i]>pr[p];i++){
		if(npr>pr[i] && pr[i]>pr[p]){
			np = i; npr = pr[i];
		}
	}
	if(npr!=3){
		b = Calc(np,num,op,pr);
	}

	int a = num[p];
	npr = 3;
	for(int i=p-1;i>=0 && pr[i]>pr[p];i--){
		if(npr>pr[i] && pr[i]>pr[p]){
			np = i; npr = pr[i];
		}
	}
	if(npr!=3){
		a = Calc(np,num,op,pr);
	}

	//printf("%d: %d|%d|%d\n",p,a,op[p],b);

	if(op[p]==0) return a+b;
	else if(op[p]==1) return a-b;
	else return a*b;
}

void OpEnum(int num[4],int op[3],int pr[3],int dep){
	if(ansflag) return;
	if(dep<3){
		for(int i=0;i<3;i++){
			op[dep] = i;
			OpEnum(num,op,pr,dep+1);
			if(ansflag) return;
		}
	}
	int sp,npr=3;
	for(int i=2;i>=0;i--){
		if(npr>pr[i]){
			sp = i; npr = pr[i];
		}
	}
	if(Calc(sp,num,op,pr)==10){
		ansflag = true;
		return;
	}
}

int main(){
	int num[4],op[4],pr[4];
	while(true){
		op[3] = -1; pr[3] = 0; ansflag = false;
		bool endflag = true;
		for(int i=0;i<4;i++){
			cin>>num[i];
			if(num[i]!=0) endflag = false;
		}
		if(endflag) return 0;
		/*for(int i=0;i<3;i++) cin>>op[i];
		for(int i=0;i<3;i++) cin>>pr[i];
		int sp,npr=3;
		for(int i=2;i>=0;i--){
			if(npr>pr[i]){
				sp = i; npr = pr[i];
			}
		}
		bool used[3]={};
		printf("%d\n",Calc(sp,num,op,pr,used));*/
		sort(num,num+4);
		do{
			for(int i=0;i<3;i++) pr[i]=i;
			do{
				OpEnum(num,op,pr,0);
				if(ansflag) goto OUT;
			}while(next_permutation(pr,pr+3));
		}while(next_permutation(num,num+4));
	
		OUT:
		if(ansflag==false) puts("0");
		else{
			int np = 0;
			for(int i=0;i<4;i++){
				for(;np<pr[i];np++) printf("(");
				printf("%d",num[i]);
				for(;np>pr[i];np--) printf(")");
				if(op[i]==0) printf(" + ");
				else if(op[i]==1) printf(" - ");
				else if(op[i]==2) printf(" * ");
			}puts("");
		}
	}
}