#include<iostream>
using namespace std;
const int N_MAX = 2505;
const int LIMIT = 10001;

int N;

void read() {
    cin >> N;
}


void work() {
    int toAdd[3] = {6, 10, 15};
    bool used[LIMIT] = {};
    int nAns = 0;
    int ans[N_MAX];

    for (int i = 0; i < 3; ++i) {
        used[toAdd[i]] = true;
        ans[nAns++] = toAdd[i];
    }
    
    for (int loop = 0; loop < 3; ++loop) {
        for (int i = toAdd[loop] * 2; i < LIMIT && nAns < N; i += toAdd[loop]) {
            if (!used[i]) {
                ans[nAns++] = i;
                used[i] = true;
            }
        }
    }

    for (int i = 0; i < nAns; ++i) {
        if (i) cout << ' ';
        cout << ans[i];
    }
    cout << endl;
}


int main() {
    read();
    work();
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
int main(){
    ll n;
    cin>>n;
    int sum=0;
    int i=1;
    while(sum<n){
        sum+=i;
        i++;
    }
    cout<<i-1<<endl;
    return 0;
}

