#include<bits/stdc++.h>
using namespace std;

long long n;
queue<long long> a,b;

int main(){
    freopen("minvalinset.in","r",stdin);
    freopen("minvalinset.out","w",stdout);
    scanf("%d",&n);
    cout<<1<<' ';
    a.push(3);
    b.push(4);
    for (int i = 1;i < n;i++){
        if (a.front() < b.front()) cout<<a.front()<<' ',a.push(2*a.front()+1),b.push(3*a.front()+1),a.pop();
        else if (a.front() == b.front()) a.pop(),i--;
        else cout<<b.front()<<' ',a.push(2*b.front()+1),b.push(3*b.front()+1),b.pop();
    }
    return 0;
}