Example

Input

1


Output

)(
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
// head

const int N=201000;
int x;
char s[N];
void gao(int y) {
	rep(i,0,y) s[i]=')';
	rep(i,0,y) s[i+y]='(';
	s[y]=')'; s[y-(y*(y+1)/2-x)]='(';
	puts(s);
}
int main() {
	scanf("%d",&x);
	for (int i=1;i<=100000;i++) if (i*(i+1)/2>=x) {
		gao(i);
		return 0;
	}
}