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

int main() {
    freopen("minvalinset.in","r",stdin);
    freopen("minvalinset.out","w",stdout);
    int n;
    cin >> n;
    set<long long> a;
    priority_queue<long long, vector<long long>, greater<long long>> pq;
    pq.push(1);
    a.insert(1);
    vector<long long> r;
    for (int i = 0; i < n; ++i) {
        long long c = pq.top();
        pq.pop();
        r.push_back(c);
        long long n1 = 2 * c + 1;
        long long n2 = 3 * c + 1;
        if (a.find(n1) == a.end()) {
            pq.push(n1);
            a.insert(n1);
        }
        if (a.find(n2) == a.end()) {
            pq.push(n2);
            a.insert(n2);
        }
    }
    for (int i = 0; i < n; ++i) {
        cout << r[i] << " ";
    }
    return 0;
}