def get_prime():
    n = int(input("enter a number: "))
    r = range(1, n+1 )
    divisiors = []

    for i in r:
        if n % i == 0:
            divisiors.append(i)
    print(divisiors)
    if len(divisiors) > 2:
        return"its not prime number"
    else:
        return "its prime number"

while True:
    get_prime()