#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


/*
  greedy: lex min s.t. OK from tail
    set x[i] = x[mate[i]] = +
    when every suffix sum can be <= 0
      undecided: -
  
  answer exists but greedy fails?
    x: answer
    x[i] = x[mate[i]] = -
    \exists j s.t. i < j < mate[j] && x[j] = x[mate[j]] = +
    x'[i] = x'[mate[i]] = +, x[j] = x[mate[j]] = -: better answer?
    take j with max mate[j]
    - if mate[i] < mate[j]:
        OK
    - otherwise
        i < j < mate[j] < mate[i]
        want: mate[j] < k <= mate[i] ==> sum(x'[k, 2N)) <= 0
        guaranteed by greedy (nothing undecided in [k, 2N))
  
  manage: balanced - balanced - ... - balanced
*/

// unite balanced interval
vector<int> uf, rs;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  chmax(rs[u], rs[v]);
  return true;
}
int R(int u) {
  return rs[root(u)];
}

int N;
vector<int> P;

int main() {
  for (; ~scanf("%d", &N); ) {
    P.resize(2*N);
    for (int i = 0; i < 2*N; ++i) {
      scanf("%d", &P[i]);
      --P[i];
    }
    
    vector<int> mate(2*N, -1);
    vector<int> app(N, -1);
    for (int i = 0; i < 2*N; ++i) {
      if (~app[P[i]]) {
        const int j = app[P[i]];
        mate[j] = i;
        mate[i] = j;
      } else {
        app[P[i]] = i;
      }
    }
// cerr<<"mate = "<<mate<<endl;
    
    // unite balanced interval
    uf.assign(2*N + 1, -1);
    rs.resize(2*N + 1);
    for (int i = 0; i <= 2*N; ++i) rs[i] = i;
    
    int cnt = 0;
    string ans(2*N, ')');
    for (int i = 0; i < 2*N; ++i) if (i < mate[i]) {
      // height -4 at i, -2 at mate[i]
      {
        int u = R(mate[i]);
        if (u == 2*N) continue;
        if ((u = R(u + 1)) == 2*N) continue;
      }
      {
        int u = R(i);
        if (u == 2*N) continue;
        if ((u = R(u + 1)) == 2*N) continue;
        if ((u = R(u + 1)) == 2*N) continue;
        if ((u = R(u + 1)) == 2*N) continue;
      }
      cnt += 2;
      ans[i] = ans[mate[i]] = '(';
      connect(mate[i], R(mate[i]) + 1);
      connect(mate[i], R(mate[i]) + 1);
      connect(i, R(i) + 1);
      connect(i, R(i) + 1);
// cerr<<i<<": ";for(int j=0;j<=2*N;++j)cerr<<R(j)<<" ";cerr<<endl;
    }
// cerr<<"ans = "<<ans<<endl;
    puts((cnt == N) ? ans.c_str() : "(");
  }
  return 0;
}