#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
//#include <atcoder/all>
using ll = long long;
using ld = long double;
#define FOR(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for(ll i = (ll)(a - 1); i >= (ll)(b); i--)
#define rrep(i, a) rFOR(i, a, 0)
#define all(c) begin(c),end(c)
using namespace std;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ld PI = acos(-1);
const ll INF = 1e18;
struct edge{ll to, cost;};

template <typename T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

int now;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vl A(N+2,-1);
    A[0]=A[N+1]=2000000000;
    now=10000000;
    bool update=true;
    vl vec0,vec1;
    vec0.push_back(0);
    vec0.push_back(N+1);
    while(update){
        update=false;
        rep(i,vec0.size()-1){
            ll mid=(vec0[i]+vec0[i+1]+1)/2;
            //cout << mid << endl;
            vec1.push_back(vec0[i]);
            if(A[mid]==-1){
                update=true;
                A[mid]=now;
                now--;
                vec1.push_back(mid);
            }
        }
        vec1.push_back(vec0.back());
        vec0=vec1;
        vec1.clear();
    }
    rep(i,N+2){
        cout << A[i] << (i==N+1?'\n':' ');
    }
}