#include<iostream>
using namespace std;

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

return 0;
}
#include<bits/stdc++.h>

#define LL long long
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()

const double eps=1e-7,PI=3.1415926;
const int N=1e6+10;

using namespace std;

int n,q,m,k,x,y,a[N],mx=-1,mn=1e9,sum;
string s,s1,s2;
map < int , int > mp;
vector < int > vec;
set < int > st;
bool ok(int x){
    int ret=0;
    if (x%2==0)ret++;
    if (x%3==0)ret++;
    if (x%5==0)ret++;
    return(x%661>0&&ret>=2);
}

int main(){
    cin>>n;
    int cnt=1;
    for (int i=0;i<n-2;i++){
        while (!ok(cnt))cnt++;
        cout<<cnt<<" ";
        cnt++;
    }
    cout<<2*5*661<<" "<<3*5*661<<endl;
    return 0;
}
