#checks if a number is a prime number
#the number to check is called num
num = int(input("Enter a number: "))
prime = True    # this will track if we have a prime number

if num > 1:
    # check for factors
    for i in range(2,num):  # sets up a loop going from 2 to num adding 1 each time
                            # so this checks every possible divisor
                            
        if (num % i) == 0:  # the % symbol returns the remainder from division
                            # so this is saying, if the remainder is 0
                            # which happens if the numbers divide perfectly
                            
            print(num,"is not a prime number")
            print(i,"times",num//i,"is",num)
            prime = False   # it can't be a prime, so change this to False
            break           # exits the loop once we find a number that divides

# if input number is less than
# or equal to 1, it is not prime
else:
    print(num,"is not a prime number")
    prime = False

# if we never changed prime to False num must be a prime number
if prime == True:
    print(num,"is a prime number")