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

int main(){
    freopen("minvalinset.in","r",stdin);
    freopen("minvalinset.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin>>n;
    priority_queue<long long, vector<long long>, greater<long long>> heap;
    heap.push(1);
    long long ans[1000005];
    int i=0;
    while(i<n){
        long long cur=heap.top();
        heap.pop();
        if(i>0 && cur==ans[i-1]){
            continue;
        }
        ans[i]=cur;
        i++;
        long long num1=2 * cur + 1;
        long long num2=3 * cur + 1;
        heap.push(num1);
        heap.push(num2);
    }
    for(int j=0;j<n;j++){
        cout<<ans[j]<<" ";
    }
    return 0;
}