//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 100005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n;
int vst[100005];
vector<int> g[100005];
vector<ii> cycle;
bool flag[100005];
int par[100005];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n;
}

void dfs(int u){
    flag[u] = 1;
    for(auto v : g[u]){
        if (!flag[v]){
            par[v] = u;
            dfs(v);
        }
        else if (flag[v] && v==0){
            par[v] = u;
            cycle.pb(ii(v,u));
        }
    }
    flag[u] = 0;
}

void proc()
{
    for(int i=0; i<n; i++){
        int u = (2*i)%n;
        g[i].pb(u);
        int v = (2*i+1)%n;
        g[i].pb(v);
        //cout << u << ' ' << v << endl;
    }
    for(int i=0; i<n; i++){
        for(auto x : g[i]){
            //cout << i << ' ' << x << '\n';
        }
    }
    dfs(0);
    for(auto x : cycle){
        if (x.fi==0 && x.se==0){
            stack<int> st;
            int cur = 0;
            st.push(0);
            while (par[cur]!=0){
                st.push(par[cur]);
                cur = par[cur];
            }
            st.push(0);
            while (st.size()){
                cout << st.top() << ' ';
                st.pop();
            }
        }
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}