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

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

int main(){

    ll N;
    cin >> N;
    V<ll> A(2*N);
    REP(i, 2*N) cin >> A[i];

    V<ll> B(2*N), ids(2*N);
    iota(ALL(ids), 0);
    sort(ALL(ids), [&](ll x, ll y){
        return A[x] < A[y];
    });

    REP(i, 2*N){
        if(i < N) B[ids[i]] = 0;
        else B[ids[i]] = 1;
    }

    stack<pll> st;
    V<char> res(2*N);
    REP(i, 2*N){
        if(st.empty()){
            st.push(pll{B[i], i});
        }else{
            auto q = st.top();
            if(q.first != B[i]){
                res[q.second] = '(';
                res[i] = ')';
                st.pop();
            }else{
                st.push(pll{B[i], i});
            }
        }
    }

    REP(i, 2*N) cout << res[i];
    cout << endl;

    return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i, n) ;for (int i = 0;i < (int)(n);i++)
#define rep2(i, s, n) ;for (int i = s; i < (int)(n);i++)
#define ALL(vec)  (vec).begin(),(vec).end()
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF (9223372036854775807+1)
#define sosuu 1000000007

int main(){
  int N;
  cin >> N;
  rep(i, N){
  rep(j, N){
   int a=rand()%9;
    if(a ==0){
    cout << "A";
    }
    if(a ==1){
    cout << "B";
    }
    if(a ==2){
    cout << "C";
    }
    if(a ==3){
    cout << "D";
    }
    if(a ==4){
    cout << "E";
    }
    if(a ==5){
    cout << "F";
    }
    if(a ==6){
    cout << "G";
    }
    if(a ==7){
    cout << "H";
    }
    if(a ==8){
    cout << ".";
    }
  }
    cout << endl;
  }
}