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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>


#define ll long long
#define ff first
#define ss second
#define pi pair<int, int>

const int MX=300000;
const ll mod=1e9+7;

int dp[100];

int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int n; cin>>n;

    set<int>st;
    set<int>::iterator it;

    for(int i=1; i<=min(n-2, 1666); i++) st.insert(6*i);

    for(int i=1; ; i++)
    {
        if(st.size()==n-1 || 10*i>10000) break;
        st.insert(10*i);
    }

    for(int i=1; ; i++)
    {
        if(st.size()==n) break;
        st.insert(15*i);
    }

    for(it=st.begin(); it!=st.end(); it++) cout<<*(it)<<' ';
    cout<<endl;

    return 0;
}

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

typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const ull base = 131;
const ull mod1 = 1e9 + 9;
const ull mod2 = 1610612741;

const int maxn = 5e5 + 10;
int x;

int main()
{
    cin >> x;
    cout << 100-x%100;
    return 0;
}