def isPrime(n):
    if (n%2==0):
        return False
    for i in range(3,(n/2),2):
        if ((n/i)*i==n):
            return False
    return True

def FindPrimes(maxN):
   foundSoFar = 0
   i = 0
   while (foundSoFar <= maxN):
        numberToCheck = i+3
        if isPrime(numberToCheck):
            foundSoFar = foundSoFar + 1
            print (numberToCheck)
        i = i+1

FindPrimes(1000)