Takes an integer and checks if its a prime number.

prime_numbers.py

array = []
number = int(input())

for i in range(1,(number+1)):
    modulo = (number % i)

    if (modulo == 0):    
        array.append(modulo)
        
    elif (len(array) > 2):
        break
        
    else:
        continue
        
if (len(array) == 2):
    print(number, "is prime <3 <3 <3")
    
else:
    print("NOPE..", number, "is not prime.")