#!/usr/bin/env python2
from itertools import islice
from math import log
 
def iprimes_upto(limit):
    is_prime = [True] * limit
    for n in xrange(2, limit):
        if is_prime[n]:
           yield n
           for i in xrange(n*n, limit, n): # start at ``n`` squared
               is_prime[i] = False
 
n = int(raw_input('Choose number of primes to print: '))
N = max(12, int(n*(log(n) + log(log(n))) + .5)) # find limit
for p in islice(iprimes_upto(N), n): # get n primes
    print p

IyEvdXNyL2Jpbi9lbnYgcHl0aG9uMgpmcm9tIGl0ZXJ0b29scyBpbXBvcnQgaXNsaWNlCmZyb20gbWF0aCBpbXBvcnQgbG9nCgpkZWYgaXByaW1lc191cHRvKGxpbWl0KToKICAgIGlzX3ByaW1lID0gW1RydWVdICogbGltaXQKICAgIGZvciBuIGluIHhyYW5nZSgyLCBsaW1pdCk6CiAgICAgICAgaWYgaXNfcHJpbWVbbl06CiAgICAgICAgICAgeWllbGQgbgogICAgICAgICAgIGZvciBpIGluIHhyYW5nZShuKm4sIGxpbWl0LCBuKTogIyBzdGFydCBhdCBgYG5gYCBzcXVhcmVkCiAgICAgICAgICAgICAgIGlzX3ByaW1lW2ldID0gRmFsc2UKCm4gPSBpbnQocmF3X2lucHV0KCdDaG9vc2UgbnVtYmVyIG9mIHByaW1lcyB0byBwcmludDogJykpCk4gPSBtYXgoMTIsIGludChuKihsb2cobikgKyBsb2cobG9nKG4pKSkgKyAuNSkpICMgZmluZCBsaW1pdApmb3IgcCBpbiBpc2xpY2UoaXByaW1lc191cHRvKE4pLCBuKTogIyBnZXQgbiBwcmltZXMKICAgIHByaW50IHA=

MTA=

10