#include <stdio.h>
#include <limits.h>
#include <math.h>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>

#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x);
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))

const int INF = 100000000;
typedef double D;
const double EPS = 1e-8;
const double PI = 3.14159;
int dx[4]={-1, 0, 1, 0}, dy[4]={0, -1, 0, 1};
using namespace std;
//typedef pair<int, int> P;

/** Problem0041 : Expression **/
int calc(int a, int b, char c)
{
	switch (c) {
		case '+': return a+b; break;
		case '-': return a-b; break;
		case '*': return a*b; break;
	}
}

int main()
{
	char ope[] = {'+', '+', '+', '*', '*', '*', '-', '-', '-'};
	int num[4];

	while (cin>>num[0]>>num[1]>>num[2]>>num[3], num[0]||num[1]||num[2]||num[3]) {
		sort(num, num+4);
		do {
			sort(ope, ope+9);
			do {
				if (calc(calc(calc(num[0], num[1], ope[0]), num[2], ope[1]), num[3], ope[2])==10) {
					printf("((%d %c %d) %c %d) %c %d\n", num[0], ope[0], num[1], ope[1], num[2], ope[2], num[3]);
					goto next;
				}
				
				else if (calc(calc(num[0], calc(num[1], num[2], ope[1]), ope[0]), num[3], ope[2])==10) {
					printf("(%d %c (%d %c %d)) %c %d\n", num[0], ope[0], num[1], ope[1], num[2], ope[2], num[3]);
					goto next;
				}

				else if (calc(num[0], calc(num[1], calc(num[2], num[3], ope[2]), ope[1]), ope[0])==10) {
					printf("%d %c (%d %c (%d %c %d))\n", num[0], ope[0], num[1], ope[1], num[2], ope[2], num[3]);
					goto next;
				}
				
				else if (calc(calc(num[0], num[1], ope[0]), calc(num[2], num[3], ope[2]), ope[1])==10) {
					printf("(%d %c %d) %c (%d %c %d)\n", num[0], ope[0], num[1], ope[1], num[2], ope[2], num[3]);
					goto next;
				}
				
				else if (calc(num[0], calc(calc(num[1], num[2], ope[1]), num[3], ope[2]),  ope[0])==10) {
					printf("%d %c ((%d %c %d) %c %d)\n", num[0], ope[0], num[1], ope[1], num[2], ope[2], num[3]);
					goto next;
				}
			} while (next_permutation(ope, ope+9));
		} while (next_permutation(num, num+4));
		printf("0\n");
	next:;
	}
}