#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <utility>
#include <functional>
using namespace std;
#define cin(vec) for(auto& i : vec) cin >> i
#define cin_2d(vec, n, m) for(int i=0; i<n; i++) for(int j=0; j<m && cin >> vec[i][j]; j++);
#define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
#define cout_2d(vec, r, c) for(int i=0; i<r; i++, cout << "\n") for(int j=0; j<c && cout << vec[i][j] << " "; j++);
#define matrix(grid, n, m) vector < vector <int> > grid(n, vector <int> (m));
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fixed(n) cout << fixed << setprecision(n)
#define Num_of_Digits(n) ((int)log10(n)+1)
#define TC int t; cin >> t; while(t--)
#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(x) int(x.size())
#define Pair pair <int, int>
#define fi first
#define se second
#define pb(x) push_back(x)
#define ull unsigned long long
#define ll long long
#define PI acos(-1)
#define Mod 1'000'000'007
#define INF 2'000'000'000
#define EPS 1e-9

void Code_Crush(){
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  #ifndef ONLINE_JUDGE    // Anwar Rizk 🤩🖤
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  #endif
  Time
}

vector <int> primes(1e8+1, true);

void Sieve(){
  int sqr = sqrt(sz(primes));
  for(int i = 2; i <= sqr; i++){
    if(primes[i]){
      for(int j = i * i; j <= 1e8; j += i)
          primes[j] = false;
    }
  }
}

int main()
{   Code_Crush();

    Sieve();
    int cnt = 1;
    cout << 2 << "\n";
    for(int i = 3; i <= 1e8; i += 2){
      if(primes[i]){
        cnt++;
        if(cnt % 100 == 1)    cout << i << "\n";
      }
    }

  return 0;
}