primesFactors.py

n = int(input('Enter a none prime number: '))

def main(number):
	f = []
	while not is_prime(number):
		if number % 2 == 0:
			f.append(2)
			number = number // 2
			if is_prime(number):
				f.append(number)
		else:
			if (is_prime(factors(number))):
				f.append(factors(number))
			print('number after the else %s'%number)
			number = number // factors(number)
			if is_prime(number):
				f.append(number)	

	for i in f:
		print (i)

def factors(n):
	l = []
	for i in range(1,n):
		if n % i == 0:
			l.append(i)

	return l[1] 
		
def is_prime(n):
    """Returns True if n is prime."""
    if n == 2:
        return True
    if n == 3:
        return True
    if n % 2 == 0:
        return False
    if n % 3 == 0:
        return False

    i = 5
    w = 2

    while i * i <= n:
        if n % i == 0:
            return False

        i += w
        w = 6 - w

    return True

if __name__ == '__main__':
	main(n)