bool M1;
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<" MB\n"
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <cstring>
#include <array>
#include <algorithm>
#include <queue>
#include <vector>
#include <bitset>
#include <ctime>
#include <cstdlib>
#include <random>
#include <set>
#include <ctime>
#include <map>
#include <stack>
#include <unordered_map>
#include <assert.h>
#define i128 __int128
#define ll long long
#define uint unsigned
#define ull unsigned long long
#define fo(a,b,c) for(ll a=b;a<=c;++a)
#define re(a,b,c) for(ll a=b;a>=c;--a)
#define pii pair<ll,ll>
#define pdd pair<db,db>
#define fi first
#define pb push_back
#define se second
#define ite set<pii> ::iterator
using namespace std;
const ll mod=998244353;
inline ll gi()
{
	ll x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9')
	{
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9')
	{
		x = (x<<1) + (x<<3) + (ch^48);
		ch = getchar();
	}
	return x * f;
}
ll _=1;
const ll inf=2e17+5,iinf=2e9;
const ll N=500005;
ll n,a[N];
set<ll> s,ss;
ll buk[N],cx[N][2],use[N];
void sol()
{
	n=gi();
	fo(i,1,n) buk[i]=1;
	fo(i,1,n*2) a[i]=gi();
	fo(i,1,n*2)
	{
		if(cx[a[i]][0]) cx[a[i]][1]=i;
		else cx[a[i]][0]=i;
	}
	ll nw=0;
	re(i,2*n,1)
	{
		nw+=buk[a[i]];
		if(i==cx[a[i]][1])
		{
			s.insert(-cx[a[i]][0]);
		}
		else
		{
			if(s.find(-i)!=s.end())
			{
				s.erase(-i);
				ss.insert(-cx[a[i]][1]);
			}
		}
		if(nw>0)
		{
			if(ss.size())
			{
				ll x=*ss.begin();
				ss.erase(x);
				use[a[-x]]=1;
				nw-=4;
			}
			else
			{
				nw-=2;
				if(s.size())
				{
					ll x=*s.begin();
					s.erase(x);
					use[a[-x]]=1;
					buk[a[-x]]=-1;
				}
			}
		}
	}
	if(nw!=0)
	{
		cout<<"(";
		return;
	}
	fo(i,1,n*2)
	{
		if(use[a[i]])
		{
			cout<<")";
		}
		else
		{
			cout<<"(";
		}
	}
}
bool M2;
int main()
{
	int Time=clock();
	look_memory;
//	_=gi();
	while(_--)
	{
		sol();
		printf("\n");
	}
	look_time;
	return 0;
}