#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
// #define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define toggleBit(x,k)  (x ^= (1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 2e5 + 10;
bool isValid(string &s) {
    map<char, int> count;
    for (char ch : s) {
        if (ch == '(' || ch == '[') {
            count[ch]++;
        } else if (ch == ')' || ch == ']') {
            char open = (ch == ')') ? '(' : '[';
            
            if (count[open] > 0) {
                count[open]--; 
            } else {
                return false;
            }
        }
    }

    if(count['('] || count['['])return false;
    return true;
}

void generateSequences(int n, string current, set<string> &ans, int open1 = 0, int open2 = 0, int close1 = 0, int close2 = 0) {
    if (current.size() == n) {
        if (isValid(current)) {
            ans.insert(current);
        }
        return;
    }
    
    generateSequences(n, current + '(', ans, open1 + 1, open2, close1, close2);
    if(open1 - close1 > 0)
    {
        generateSequences(n, current + ')', ans, open1, open2, close1 + 1, close2);
    }
    generateSequences(n, current + '[', ans, open1, open2 + 1, close1, close2);
    if(open2 - close2 > 0)
    {
        generateSequences(n, current + ']', ans, open1, open2, close1, close2 + 1);
    }
}

void solve()
{
    int n, m;
    cin >> n;
    if(n % 2)
    {
        cout << 0 << endl;
        return;
    }
    set<string>ans;
    generateSequences(n, "", ans);
    
    for(auto it : ans)
    {
        cout << it << endl;
    }

}

int32_t main()
{
    Abid_52;
    int t = 1;
    // cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}