#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    auto is_valid = [&](vector<string> &S) {
        int N = S.size();
        sort(S.begin(), S.end());
        int cnt = 0;
        do {
            string T = "";
            rep(i,N) T += S[i];
            vector<int> A(T.size());
            rep(i,T.size()) A[i] = (T[i] == '(' ? +1 : -1);
            vector<int> sum(T.size() + 1);
            rep(i,T.size()) sum[i + 1] += sum[i] + A[i];
            int ok = 1;
            rep(i,T.size()) ok &= sum[i] >= 0;
            ok &= sum.back() == 0;
            if(ok) cnt++;
        } while(next_permutation(S.begin(), S.end()));
        return cnt == 1;
    };

    vector<string> S = {
        "",
        "",
        "()",
        "()()",
        "()(())()",
        "()(())(())()",
        "()(())((()))(())()",
        "()(())((()))((()))(())()",
        "()(())((()))(((())))((()))(())()"
    };

    int N; cin >> N;
    vector<string> ans;
    int p = 0;
    if(N % 2 == 0) {
        for(int i = 1; i <= N; i += 2) {
            ans.push_back("");
            rep(_,i) ans.back() += S[N][p++];
        }
        for(int i = N - 1; i >= 1; i -= 2) {
            ans.push_back("");
            rep(_,i) ans.back() += S[N][p++];
        }
    } else {
        for(int i = 1; i <= N - 2; i += 2) {
            ans.push_back("");
            rep(_,i) ans.back() += S[N][p++];
        }
        ans.push_back("");
        rep(_,N-1) ans.back() += S[N][p++];
        for(int i = N - 2; i >= 1; i -= 2) {
            ans.push_back("");
            rep(_,i) ans.back() += S[N][p++];
        }
    }
    if(is_valid(ans)) {
        for(auto s : ans) cout << s << "\n";
    }
}