#include <bits/stdc++.h>
#include <utility>
#include <vector>
using namespace std;

int n;
vector<long long> prefix;

vector<pair<int, int>> szamolas(int b) {
	vector<pair<int, int>> eredmeny;
	pair<int, int> par = pair<int, int>(-1, -1);
	if(b >= n) par = pair<int, int>(0, 0);
	bool jo = false;
	int j = b + 1;
	for(int i = b + 2; i <= n; i++) {
		while(prefix[j] - prefix[b] < prefix[i] - prefix[j]) {
			j++;
		}
		if(prefix[j] - prefix[b] == prefix[i] - prefix[j]) {
			par = pair<int, int>(j, i);
			vector<pair<int, int>> v = szamolas(i);
			if(v[0].first > -1) {
				eredmeny = v;
				jo = true;
			}
		}
	}
	eredmeny.push_back(par);
	return eredmeny;
}

int main() {
	cin >> n;

	prefix.resize(n + 1);

	for(int i = 1; i <= n; i++) {
		cin >> prefix[i];
		prefix[i] += prefix[i - 1];
	}

	vector<pair<int, int>> eredmeny = szamolas(0);
	if(eredmeny[0].first == -1) {
		cout << -1 << endl;
		return 0;
	}
	reverse(eredmeny.begin(), eredmeny.end());

	int j = 0;
	for(long long i = 1; i <= prefix[n]; i++) {
		if(i <= prefix[eredmeny[j].first]) {
			cout << "(";
		} else if(i <= prefix[eredmeny[j].second]) {
			cout << ")";
		} else {
			j++;
			cout << "(";
		}
	}
	cout << endl;
	
	return 0;
}