#include "bits/stdc++.h"
#include<vector>
#include<iostream>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<iomanip>
#include<assert.h>
#include<unordered_map>
#include<unordered_set>
#include<string>
#include<stack>
#include<complex>
#include<memory>

#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
using Graph=vector<vector<int>>;
using ll=long long;
#define WHATS(var)cout<<__LINE__<<' '<<#var<<"="<<var<<endl;
	
template<class S, class T> ostream& operator <<(ostream &os, const pair<S, T> v){
	os << "( " << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<T> &v){
	for(int i = 0; i < v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<vector<T>> &v){
	for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<set<T>> &v){
	for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const set<T> &v){
	int i=0;
	for(auto it:v){
		if(i > 0){os << ' ';}
		os << it;
		i++;
	} 
	return os;
}


//
vector<vector<string>>sts(6,vector<string>(2));

void cc(vector<int>v){
    int k=v.size()/3;
    vector<vector<int>>nums(k);
    for(int i=0;i<v.size();++i){
        nums[v[i]].push_back(i);
    }
    //WHATS(st)
    for(int i=0;i<k;++i){
        assert(nums[i].size()==3);
       // WHATS(nums)
        assert(i==abs((nums[i][2]-nums[i][1])-(nums[i][1]-nums[i][0])));
    }
}
void cc(string st){
    int k=st.size()/3;
    vector<vector<int>>nums(k);
    for(int i=0;i<st.size();++i){
        if(st[i]!='?')nums[st[i]-'0'].push_back(i);
    }
    //WHATS(st)
    for(int i=0;i<k;++i){
        assert(nums[i].size()==3);
       // WHATS(nums)
        assert(i==abs((nums[i][2]-nums[i][1])-(nums[i][1]-nums[i][0])));
    }
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie();
    sts[0][0]="000";
    sts[1][1]="01010?1";
    sts[2][0]="202101201";
    sts[2][1]="22102101?0";
    sts[3][0]="332203201101";
    sts[3][1]="33221321010?0";
    sts[4][0]="244223341131000";
    sts[4][1]="34423324000211?1";
    sts[5][0]="355443235421211000";
    sts[5][1]="35544313541221020?0";
    for(int i=2;i<=5;++i){
        cc(sts[i][0]);
        cc(sts[i][1]);
    }
    int N;cin>>N;
    N--;

    vector<pair<pair<int,int>,int>>ps;

    int now=N;
    if(N==1){
        cout<<-1<<endl;
        return 0;
    }
    bool flag=false;
    while(now>=6){
        if(now%2==0){
            ps.push_back(make_pair(make_pair(now,now/2),0));
        }else{
            ps.push_back(make_pair(make_pair(now,now/2),1));
            flag=!flag;
        }
        now=now/2-1;
    }
    ps.push_back(make_pair(make_pair(now,0),flag));
    vector<vector<int>>vs(ps.size());
    for(auto p:ps){
        vector<int>v;
        
        if(p.first.first<=5){
            for(auto c:sts[p.first.first][p.second]){
                if(c=='?')v.push_back(-1);
                else v.push_back(c-'0');
            }
        }else{
            if(p.first.first%2==1){
                int aa=0;
                for(int x=p.first.first;x>p.first.second;--x){
                    v.push_back(x);
                    v.push_back(x);
                }
                v.push_back(p.first.second);
                for(int x=p.first.first;x>p.first.second;--x){
                    v.push_back(x);
                }
                v.push_back(p.first.second);
                v.push_back(-1);
                v.push_back(p.first.second);
            }else{
                for(int x=p.first.first;x>=p.first.second;--x){
                    v.push_back(x);
                    v.push_back(x);
                }
                for(int x=p.first.first;x>=p.first.second;--x){
                    v.push_back(x);
                }
            }
        }
        //WHATS(v)
        vs.push_back(v);
    }
    vector<int>anss;

    flag=false;
    for(int i=0;i<vs.size();++i){
        auto v=vs[i];
        if(find(v.begin(),v.end(),-1)!=v.end()){
            if(!flag){
                for(auto x:v){
                    anss.push_back(x);
                }
            }else{
                int k=anss.back();
                anss.pop_back();
                anss.pop_back();
                reverse(v.begin(),v.end());
                for(int i=0;i<v.size();++i){
                    
                    if(i==1)anss.push_back(k);
                    else anss.push_back(v[i]);
                }
            }
            flag=!flag;
        }
    }
    for(int i=0;i<vs.size();++i){
        auto v=vs[i];
        if(find(v.begin(),v.end(),-1)==v.end()){
            
            for(auto x:v){
                anss.push_back(x);
            }
        }

    }
    //WHATS(anss)
    for(int i=0;i<anss.size();++i){
        cout<<anss[i];
        if(i==anss.size())cout<<endl;
        else cout<<' ';
    }
    cc(anss);
	return 0;
}