def isPrime(n):
    x = range(n+1)[1:]
    for i in x:
        if n%i == 0:
            return False
    return True

num_of_primes = 0
counter = 0

while True:
    print counter
    if isPrime(counter):
        num_of_primes += 1
    if num_of_primes == 10001:
        print num_of_primes
        break
    counter += 1