#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <deque>

using namespace std;

#define rd read()
#define int long long

const int N = 1e6 + 10;
const int MOD = 998244353;
const int INF = 0x7fffffff;
const int Fill = 0x3f;
const int FillINF = 0x3f3f3f3f;

void write(int n)
{
    if (n < 0)
    {
        putchar('-');
        n = -n;
    }
    if (n < 10)
    {
        putchar(n + '0');
        return;
    }
    write(n / 10);
    putchar(n % 10 + '0');
    return;
}
void wt(int n, bool o = 1)
{
    write(n);
    if (!o)
    {
        putchar(' ');
    }
    else
    {
        putchar('\n');
    }
}

int read()
{
    char ch;
    int type = 1, n = 0;
    ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
        {
            type = -1;
        }
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        n = (n << 1) + (n << 3) + (ch ^ 48);
        ch = getchar();
    }
    return n * type;
}

int n;

int f(int x)
{
    int i = 0;
    int ans = x;
    for (i = 0; 1 << i <= x; i++)
    {
        ans ^= 1 << i;
    }
    // ans = ~x;
    // cout << ans;
    // ans = abs(ans ^ x);
    return ans;
    // while (x)
    // {
    //     ans += !(x & 1);
    //     ans <<= 1;
    //     x >>= 1;
    // }
}

void solve()
{
    int i, j;
    stack <int> s;
    int k;
    int lst;
    n = rd;
    // wt(f(n));
    if (n == 1)
    {
        wt(0);
        return ;
    }
    i = n - 1;
    lst = n - 1;
    while (i >= 0)
    {
        if (i == 1 && n & 1)
        {
            s.push(0);
            // wt(0);
            break;
        }
        k = f(i);

        for (j = k; j <= i; j++)
        {
            s.push(j);
            // wt(j, 0);
        }
        i = k - 1;
    }
    while (!s.empty())
    {
        wt(s.top(), 0);
        s.pop();
    }
}

signed main()
{
    int T;
    int i, j;
    T = 1;
    while (T--)
    {

        solve();
    }
    return 0;
}