import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==================================================================
	Set<Integer> set = new HashSet<>();
	int K, max;
	void makeTree(int now) {
		if(now < 0)		now = 0;
		if(now > max)	now = max;
		while(set.contains(now)) {
			if(now == max)	return;
			now++;
		}
		out.print(now + " ");
		set.add(now);
		int offset = (now - 3 * K) / 2;
//		out.println("  now = " + now + "  offset = " + offset);
		makeTree(now - offset);
		makeTree(now + offset);
	}
    public void solve() {
    	K = Integer.parseInt(sc.next());
    	max = 1;
    	for (int i = 0; i < K; i++) {
			max *= 2;
		}
    	max--;
//    	out.println("  max = " + max);
    	if(max <= 3 * K) {
    		for (int i = max; i > 0; i--) {
    			out.print(i + " ");
			}
    		out.println("");
    		return;
    	}
		for (int i = 3 * K; i > 0; i--) {
			out.print(i + " ");
			set.add(i);
		}
		makeTree(3 * K + (max - 3 * K)/2);
    }
}