gen2.py

def nextPrime(n=2):
    def isPrime(num):
        if(num == 2):
            return True
        for x in range(2, int(num/2) + 1):
            if num%x == 0:
                return False
        return True

    while(True):
        if(isPrime(n)):
            yield n
        n = n + 1


for num in nextPrime():
    print(num)
    input()