#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';}
#define nl; cout<<'\n';
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
vector<pair<vvi,int>>ans(51, mp((vvi){}, -1));
void solve(int sz, int num){
vvi g;
int x = 0;
f0r(i, num){
vi tmp;
for(int j = x; j < x + 12/sz; j++)tmp.pb(j);
x += 12/sz;
g.pb(tmp);
}
int mx = g.back().back();
vvi f;
if(sz == 2){
f0r(i, num){
FOR(j, i + 1, num){
vi cur;
for(auto u : g[i])cur.pb(u);
for(auto u : g[j])cur.pb(u);
f.pb(cur);
}
}
}
else if(sz == 3){
f0r(i, num){
FOR(j, i + 1, num){
FOR(k, j + 1, num){
vi cur;
for(auto u : g[i])cur.pb(u);
for(auto u : g[j])cur.pb(u);
for(auto u : g[k])cur.pb(u);
f.pb(cur);
}
}
}
}
else if(sz == 1){
f0r(i, num){
f.pb(g[i]);
}
}
else if(sz == 6){
f0r(i, num){
FOR(j, i + 1, num){
FOR(k, j + 1, num){
FOR(l, k+1, num){
FOR(m, l+1, num){
FOR(n, m+1, num){
vi cur;
for(auto u : g[i])cur.pb(u);
for(auto u : g[j])cur.pb(u);
for(auto u : g[k])cur.pb(u);
for(auto u : g[l])cur.pb(u);
for(auto u : g[m])cur.pb(u);
for(auto u : g[n])cur.pb(u);
f.pb(cur);
}
}
}
}
}
}
}
else if(sz == 12){
f0r(i, num){
FOR(j, i + 1, num){
FOR(k, j + 1, num){
FOR(l, k+1, num){
FOR(m, l+1, num){
FOR(n, m+1, num){
FOR(o, n+1, num){
FOR(p, o+1, num){
FOR(q, p+1, num){
FOR(r, q+1, num){
FOR(s, r+1, num){
FOR(t, s+1, num){
vi cur;
for(auto u : g[i])cur.pb(u);
for(auto u : g[j])cur.pb(u);
for(auto u : g[k])cur.pb(u);
for(auto u : g[l])cur.pb(u);
for(auto u : g[m])cur.pb(u);
for(auto u : g[n])cur.pb(u);
for(auto u : g[o])cur.pb(u);
for(auto u : g[p])cur.pb(u);
for(auto u : g[q])cur.pb(u);
for(auto u : g[r])cur.pb(u);
for(auto u : g[s])cur.pb(u);
for(auto u : g[t])cur.pb(u);
f.pb(cur);
}
}
}
}
}
}
}
}
}
}
}
}
}
else{
f0r(i, num){
FOR(j, i + 1, num){
FOR(k, j + 1, num){
FOR(l, k+1, num){
vi cur;
for(auto u : g[i])cur.pb(u);
for(auto u : g[j])cur.pb(u);
for(auto u : g[k])cur.pb(u);
for(auto u : g[l])cur.pb(u);
f.pb(cur);
}
}
}
}
}
if(f.size() < 51 && (ans[f.size()].second == -1 || mx < ans[f.size()].second) && mx < 50)ans[f.size()] = mp(f, mx + 1);
}
vvi merge(vvi a, vvi b, int c){
vvi ret = a;
for(auto u : b){
vi tmp;
for(auto x : u){
tmp.pb(x + c);
}
ret.pb(tmp);
}
return ret;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
in(n);
vi xs = {1,2,3,4,6,12};
for(auto u : xs){
FOR(num, 1, 20){
solve(u, num);
}
}
FOR(i, 1, 51){
if(ans[i].second == -1){
for(int j = 1; j < i; j++){
if(ans[j].second != -1 && ans[i-j].second != -1 && ans[j].second + ans[i-j].second <= 50 && (ans[i].second == -1 || ans[j].second + ans[i-j].second < ans[i].second)){
// dout2()
ans[i] = mp(merge(ans[j].first, ans[i-j].first, ans[j].second), ans[j].second + ans[i-j].second);
}
}
}
}
if(false){
int x = 0;
f0r(i, n){
for(int j = x; j < x + 12; j++)cout<<j<<' ';
cout<<'\n';
x += 12;
}
}
else{
for(auto u : ans[n].first){
vout(u); nl;
}
}
}
