#!/usr/bin/env python3

primes=[2,3,5,7]
primesquared=[4,9,25,49]

current=9
max_number=100

def find_max_index(candidate):
    i = 0
    while primesquared[i] < candidate:
        i = i+1
    if primesquared[i] == candidate:
        return(0)
    else:
        return(i)

def is_prime(c, m):
    if m == 0:
        return(False)
    for i in list(range(m)):
        if (c % primes[i]) == 0:
            return(False)
    return(True)

while len(primes) < max_number:
    if is_prime(current, find_max_index(current)):
        primes.append(current)
        primesquared.append(current * current)
    current = current + 2

for p in primes:
    print(p)