#include <iostream>
#include <cstdlib>
#include <string>
#include <ctime>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#include <cmath>
using namespace std;

int k;

void solve(int min, int max){
	if(min + 1 == max){
		printf("%d %d ", min, max);
		return;
	}else if(min >= max){
		printf("%d ", min);
		return;
	}
	int mid = (max+min)/2;
	printf("%d ", mid);
	solve(min, mid-1);
	solve(mid+1, max);
	return;
}

int main(){
	scanf("%d", &k);
	int max = pow(2, k) - 1;
	solve(1, max);
	printf("\n");
	return 0;
}