#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define N 1000007
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

int cnt[N];

int main() {
	int n = rd();
	if (n == 1) {printf("%d\n", rd()); return 0;}
	vector<string> res;
	rep(i, 1, n) ++cnt[rd()];
	if (cnt[1] == 1) {
		printf("(1+");
		rep(i, 2, N - 1) if (cnt[i]) {--cnt[i]; printf("%d)", i); break;}
		rep(i, 2, N - 1) while (cnt[i]--) printf("*%d", i);
		return 0;
	}
	while (cnt[1] && cnt[2]) {--cnt[1]; --cnt[2]; res.pb("1+2");}
	while (cnt[1] >= 3) {cnt[1] -= 3; res.pb("1+1+1");}
	while (cnt[1] >= 2) {cnt[1] -= 2; res.pb("1+1");}
	if (cnt[1]) {
		string tmp = res.back() + "+1";
		res.pop_back(); res.push_back(tmp);
	}
	bool fl = false;
	for (auto x : res) {
		if (!fl) fl = true; else putchar('*'); 
		printf("(%s)", x.c_str());
	}
	rep(i, 2, N - 1) while (cnt[i]--) {
		if (!fl) fl = true; else putchar('*'); 
		printf("%d", i);
	}
	return 0;
}