#include <cassert>
#include <iostream>
#include <vector>

using namespace std;
using ll = long long;

const int MAXM = 50005;

int main() {
    cin.tie(0), ios::sync_with_stdio(0);

    int N;
    cin >> N;
    vector<int> a(N);
    for (int& x : a) cin >> x;

    vector dp(N, vector<bool>(MAXM));
    dp[0][a[0]] = 1;

    for (int i = 1; i < N; i++) {
        for (int j = 0; j < MAXM; j++) {
            dp[i][j] =
                (j + a[i] < MAXM && dp[i - 1][j + a[i]]) ||
                (j - a[i] >= 0 && dp[i - 1][j - a[i]]);
        }
    }

    if (dp[N - 1][0]) {
        vector<int> result(N);
        for (int i = N - 1, x = 0; i > 0; i--) {
            if (x + a[i] < MAXM && dp[i - 1][x + a[i]]) {
                x += a[i];
                result[i] = 1;
            } else {
                x -= a[i];
            }
        }

        for (int i = 0; i < N; i++) {
            cout << string(a[i], "()"[result[i]]);
        }

        cout << "\n";
    } else {
        cout << "-1\n";
    }
}