#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int nxt[N << 1], lst[N];

signed main() {
    freopen("fate.in", "r", stdin);
    freopen("fate.out", "w", stdout);
    int n; scanf("%d", &n);
    for (int i = 1, x; i <= n * 2; ++i) {
        scanf("%d", &x);
        if (lst[x]) nxt[lst[x]] = i;
        else lst[x] = i;
    }
    string res(n * 2 + 1, ')');
    set<int> S;
    for (int i = 1; i < 2 * n; i += 2) S.insert(i);
    for (int i = 1; !S.empty(); ++i) {
        if (*S.begin() < i) {
            puts("(");
            exit(0);
        }
        if (nxt[i] && *S.rbegin() >= nxt[i]) {
            S.erase(*S.begin()), S.erase(S.lower_bound(nxt[i]));
            res[i] = res[nxt[i]] = '(';
        }
    }
    puts(res.substr(1).c_str());
    return 0;
}