#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int MOD = pow(10,9)+7;
const int MOD2 = 998244353;
const int INF = LLONG_MAX/2;
int primes[1000000];
void seive(){
fill(primes, primes + 1000000, 1);
primes[0] = primes[1] = 0;
for(int i = 2 ; i*i < 1000000 ; i++){
if(primes[i]){
for(int j = i*i ; j < 1000000 ; j += i){
primes[j] = 0;
}
}
}
}
void solve() {
seive();
for(int i = 0 ; i<=100; i++){
if(primes[i]==1){
cout<<i<<" ";
}
}
cout<<endl;
}
signed main(){
ios::sync_with_stdio(false); cin.tie(NULL);
//int t;
//cin >> t;
//while(t--){
solve();
//}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBlbmRsICdcbicKI2RlZmluZSBpbnQgbG9uZyBsb25nCmNvbnN0IGludCBNT0QgPSBwb3coMTAsOSkrNzsKY29uc3QgaW50IE1PRDIgPSA5OTgyNDQzNTM7CmNvbnN0IGludCBJTkYgPSBMTE9OR19NQVgvMjsKIAppbnQgcHJpbWVzWzEwMDAwMDBdOwogCnZvaWQgc2VpdmUoKXsKICAgIGZpbGwocHJpbWVzLCBwcmltZXMgKyAxMDAwMDAwLCAxKTsKICAgIHByaW1lc1swXSA9IHByaW1lc1sxXSA9IDA7CiAgICBmb3IoaW50IGkgPSAyIDsgaSppIDwgMTAwMDAwMCA7IGkrKyl7CiAgICAgICAgaWYocHJpbWVzW2ldKXsKICAgICAgICAgICAgZm9yKGludCBqID0gaSppIDsgaiA8IDEwMDAwMDAgOyBqICs9IGkpewogICAgICAgICAgICAgICAgcHJpbWVzW2pdID0gMDsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KfQp2b2lkIHNvbHZlKCkgewogICAgc2VpdmUoKTsKICAgIGZvcihpbnQgaSA9IDAgOyBpPD0xMDA7IGkrKyl7CiAgICAgICAgaWYocHJpbWVzW2ldPT0xKXsKICAgICAgICAgICAgY291dDw8aTw8IiAiOwogICAgICAgIH0KICAgIH0KICAgIGNvdXQ8PGVuZGw7Cn0KIApzaWduZWQgbWFpbigpewogICAgaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOyBjaW4udGllKE5VTEwpOwogICAgLy9pbnQgdDsKICAgIC8vY2luID4+IHQ7CiAgICAvL3doaWxlKHQtLSl7CiAgICAgICAgc29sdmUoKTsKICAgIC8vfQogICAgcmV0dXJuIDA7Cn0=