#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    freopen("minvalinset.in", "r", stdin);
    freopen("minvalinset.out", "w", stdout);
    int n;
    cin >> n;
    priority_queue<int, vector<int>, greater<int>> pq;
    unordered_map<int, bool> mp;
    pq.push(1);
    int cnt = 0;
    while (cnt < n) {
        pq.push(2 * pq.top() + 1);
        pq.push(3 * pq.top() + 1);
        if (mp[pq.top()] == 0) {
            cout << pq.top() << ' ';
            cnt++;
            mp[pq.top()] = 1;
        }
        pq.pop();
    }
    return 0;
}