// 9.6 Print all valid parentheses sequences of n ()s.

 #include <iostream>

 #include <string>

 #include <vector>

 using namespace std;

 void DFS(int idx, int n, string s, vector<vector<string> > &result)

 {

     if (idx == n) {

         result[n].push_back(s);

         return;

     } else {

         int i, j;

         for (i = ; i <= n - idx; ++i) {

             for (j = ; j < (int)result[i - ].size(); ++j) {

                 DFS(idx + i, n, s + '(' + result[i - ][j] + ')', result);

             }

         }

     }

 }

 int main()

 {

     vector<vector<string> > result;

     int n;

     int i;

     result.resize();

     result[].push_back("");

     while (cin >> n && n > ) {

         if (n >= (int)result.size()) {

             for (i = (int)result.size(); i <= n; ++i) {

                 result.push_back(vector<string>());

                 DFS(, i, "", result);

             }

         }

         for (i = ; i < (int)result[n].size(); ++i) {

             cout << result[n][i] << endl;

         }

     }

     return ;

 }