#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }


typedef vector<pair<int, string> > pisv;
string ans;

bool rec(pisv  n)
{
	if(n.size() == 1)
	{
		if(n[0].first == 10)
			ans = n[0].second;

		return n[0].first == 10;
	}

	bool res = false;
	pisv a;

	rep(i, n.size()-1)
	{
		// +
		{
			pisv aa = a;
			aa.push_back(mp(n[i].first + n[i+1].first, "(" + n[i].second + " + " + n[i+1].second + ")"));
			REP(j, i+2, n.size())
				aa.push_back(n[j]);

			res = res || rec(aa);
		}

		// -
		{
			pisv aa = a;
			aa.push_back(mp(n[i].first - n[i+1].first, "(" + n[i].second + " - " + n[i+1].second + ")"));
			REP(j, i+2, n.size())
				aa.push_back(n[j]);

			res = res || rec(aa);
		}
		
		// *
		{
			pisv aa = a;
			aa.push_back(mp(n[i].first * n[i+1].first, "(" + n[i].second + " * " + n[i+1].second + ")"));
			REP(j, i+2, n.size())
				aa.push_back(n[j]);

			res = res || rec(aa);
		}

		a.push_back(n[i]);
	}

	return res;
}


int main()
{
	pisv v(4);

	while(cin >> v[0].first && v[0].first)
	{
		rep(i, 3)
			cin >> v[i+1].first;

		rep(i, 4)
			v[i].second = v[i].first + '0';

		bool res = false;
		
		sort(ALL(v));

		do	res = res || rec(v);
		while(next_permutation(ALL(v)));

		cout << (res ? ans : "0") << endl;
	}
}