def isDivisible(a, b):
    if a%b == 0:
        return True
    else:
        return False
 
def isPrime(x):
    etaPrimeNumber = True
    for i in range(2,x,1):
        if isDivisible(x, i) == True:
            etaPrimeNumber = False
            break
 
    if etaPrimeNumber == True:
        return True
    else:
        return False
 
def nPrime(n):
    for i in range(2, n+1, 1):
        if isPrime(i):
            print(i, end = " ")
 
nPrime(10)
 
 

ZGVmIGlzRGl2aXNpYmxlKGEsIGIpOgogICAgaWYgYSViID09IDA6CiAgICAgICAgcmV0dXJuIFRydWUKICAgIGVsc2U6CiAgICAgICAgcmV0dXJuIEZhbHNlCgpkZWYgaXNQcmltZSh4KToKICAgIGV0YVByaW1lTnVtYmVyID0gVHJ1ZQogICAgZm9yIGkgaW4gcmFuZ2UoMix4LDEpOgogICAgICAgIGlmIGlzRGl2aXNpYmxlKHgsIGkpID09IFRydWU6CiAgICAgICAgICAgIGV0YVByaW1lTnVtYmVyID0gRmFsc2UKICAgICAgICAgICAgYnJlYWsKICAgIAogICAgaWYgZXRhUHJpbWVOdW1iZXIgPT0gVHJ1ZToKICAgICAgICByZXR1cm4gVHJ1ZQogICAgZWxzZToKICAgICAgICByZXR1cm4gRmFsc2UKCmRlZiBuUHJpbWUobik6CiAgICBmb3IgaSBpbiByYW5nZSgyLCBuKzEsIDEpOgogICAgICAgIGlmIGlzUHJpbWUoaSk6CiAgICAgICAgICAgIHByaW50KGksIGVuZCA9ICIgIikKCm5QcmltZSgxMCkKCg==