/*
C++ Code
http://oijzh.cnblogs.com
by jiangzh
*/
#include<cstdio>
#include<iostream>
#include<cctype>
#include<string>
#include<queue>
#include<algorithm>
#include<vector>
using namespace std;int a[5],num[5];//a是输入数据   num用来存每次全排列的方案
priority_queue<string,vector<string>,greater<string> > q;
bool h[5];
char op[5]={'*','+','-','/'},opp[5];//op是四种运算符   opp用来存每次全排列的方案int calc(int x,char op,int y)
{if(op=='+') return x+y;if(op=='-') return x-y;if(op=='*') return x*y;if(op=='/') if(x>y && y>0 && x%y==0)return x/y;else return -1;//不满足除法要求的就返回-1
}void check()//判断当前方案是否可行，可行则入队列
{int temp,temp2;string s;bool flag;//   (((A~B)~C)~D)flag=true;//标记是否不满足除法（返回-1），不满足就为false，   -----下同if((temp=calc(num[1],opp[1],num[2]))==-1)flag=false;if((temp=calc(temp,opp[2],num[3]))==-1)flag=false;if((temp=calc(temp,opp[3],num[4]))==-1)flag=false;if(flag && temp==24){s="(((";s+=(num[1]+'0');s+=opp[1];s+=(num[2]+'0');s+=")";s+=opp[2];s+=(num[3]+'0');s+=")";s+=opp[3];s+=(num[4]+'0');s+=")";q.push(s);}//   ((A~B)~(C~D))flag=true;if((temp=calc(num[1],opp[1],num[2]))==-1)flag=false;if((temp2=calc(num[3],opp[3],num[4]))==-1)flag=false;if((temp=calc(temp,opp[2],temp2))==-1)flag=false;if(flag && temp==24){s="((";s+=(num[1]+'0');s+=opp[1];s+=(num[2]+'0');s+=")";s+=opp[2];s+="(";s+=(num[3]+'0');s+=opp[3];s+=(num[4]+'0');s+="))";q.push(s);}//   (A~((B~C)~D))flag=true;if((temp=calc(num[2],opp[2],num[3]))==-1)flag=false;if((temp=calc(temp,opp[3],num[4]))==-1)flag=false;if((temp=calc(num[1],opp[1],temp))==-1)flag=false;if(flag && temp==24){s="(";s+=(num[1]+'0');s+=opp[1];s+="((";s+=(num[2]+'0');s+=opp[2];s+=(num[3]+'0');s+=")";s+=opp[3];s+=(num[4]+'0');s+="))";q.push(s);}//   ((A~(B~C))~D)flag=true;if((temp=calc(num[2],opp[2],num[3]))==-1)flag=false;if((temp=calc(num[1],opp[1],temp))==-1)flag=false;if((temp=calc(temp,opp[3],num[4]))==-1)flag=false;if(flag && temp==24){s="((";s+=(num[1]+'0');s+=opp[1];s+="(";s+=(num[2]+'0');s+=opp[2];s+=(num[3]+'0');s+="))";s+=opp[3];s+=(num[4]+'0');s+=")";q.push(s);}//   (A~(B~(C~D)))flag=true;if((temp=calc(num[3],opp[3],num[4]))==-1)flag=false;if((temp=calc(num[2],opp[2],temp))==-1)flag=false;if((temp=calc(num[1],opp[1],temp))==-1)flag=false;if(flag && temp==24){s="(";s+=(num[1]+'0');s+=opp[1];s+="(";s+=(num[2]+'0');s+=opp[2];s+="(";s+=(num[3]+'0');s+=opp[3];s+=(num[4]+'0');s+=")))";q.push(s);}}void dfsop(int x)
{if(x>3){//for(int i=1;i<=3;i++) printf("%c ",opp[i]);//printf("\n");check();return;}for(int i=0;i<4;i++){opp[x]=op[i];dfsop(x+1);}
}void dfs(int x)
{if(x>4){//for(int i=1;i<=4;i++) printf("%d ",num[i]);//printf("\n");dfsop(1);//生成符号的全排列return;}for(int i=1;i<=4;i++)if(!h[i]){num[x]=a[i];h[i]=true;dfs(x+1);h[i]=false;}
}int main()
{freopen("fun.in","r",stdin);freopen("fun.out","w",stdout);for(int i=1;i<=4;i++) scanf("%d",&a[i]);dfs(1);//生成数字的全排列if(!q.empty())//用优先队列储存，直接输出队头字典序小的{cout<<q.top();exit(0);}return 0;
}