def count(n):
    while True:
        yield n
        n=n+1

def prime(g):
    p = g.next()
    yield p
    gg = prime(g)
    while True:
        n = gg.next()
        if n%p != 0: yield n
        else: pass

g = prime(count(2))
for i in range(200):
    print g.next()