def isPrime(x):
    factorlist = []
    for n in range(1 , x+1):
        if x % n == 0:
            factorlist.append(n)
    #print(len(factorlist))
    if len(factorlist) == 2:
        return True
    else: 
        return False
    

def primeFactors(x):
    factorlist = []
    for n in range(1 , int(x/2)):
      if x % n == 0:
          if isPrime(n):
            factorlist.append(n)
            print(n)
    print("Done!")
    #print(len(factorlist))

primeFactors(600851475143)
#print(isPrime(5))