#!/usr/bin/env python3

import re
import sys

if sys.argv[1:]:
    top=int(re.sub(',', '', sys.argv[1]))
else:
    top=100

primes = [ 2 ]
num_primes_found = 1

print('prime #1 is 2')
candidate_prime = 3
while candidate_prime <= top:
    divisible = False
    for possible_divisor in primes:
        #print('candidate_prime: {}, possible_divisor: {}, primes: {}'.format(candidate_prime, possible_divisor, primes))
        if candidate_prime % possible_divisor == 0:
            divisible = True
            break
    if not divisible:
        sys.stdout.flush()
        primes.append(candidate_prime)
        num_primes_found += 1
        print('prime #{} is {}'.format(num_primes_found, candidate_prime))
    candidate_prime += 2