import math

def factorize(n): 
	pf = []
	count =  0
	while ((n % 2 > 0) == False):  
		n >>= 1  
		count += 1 

	if (count > 0): 
		pf.append(2) 
  
	# check for all the possible 
	# numbers that can divide it 
	for i in range(3, int(math.sqrt(n)) + 1, 2): 
		count = 0; 
		while (n % i == 0):  
			count += 1
			n = n//i 
		if (count > 0): 
			pf.append(i) 
		# i += 2
	if n > 2:
		pf.append(n)
	return pf
d4b1ec35e2cebafbe7e81a1e4da874da175c840d
<mask token>

<mask token>


def factorize(n):
    pf = []
    count = 0
    while (n % 2 > 0) == False:
        n >>= 1
        count += 1
    if count > 0:
        pf.append(2)
    for i in range(3, int(math.sqrt(n)) + 1, 2):
        count = 0
        while n % i == 0:
            count += 1
            n = n // i
        if count > 0:
            pf.append(i)
    if n > 2:
        pf.append(n)
    return pf

import math


def factorize(n):
    pf = []
    count = 0
    while (n % 2 > 0) == False:
        n >>= 1
        count += 1
    if count > 0:
        pf.append(2)
    for i in range(3, int(math.sqrt(n)) + 1, 2):
        count = 0
        while n % i == 0:
            count += 1
            n = n // i
        if count > 0:
            pf.append(i)
    if n > 2:
        pf.append(n)
    return pf

import math

def factorize(n): 
	pf = []
	count =  0
	while ((n % 2 > 0) == False):  
		n >>= 1  
		count += 1 

	if (count > 0): 
		pf.append(2) 
  
	# check for all the possible 
	# numbers that can divide it 
	for i in range(3, int(math.sqrt(n)) + 1, 2): 
		count = 0; 
		while (n % i == 0):  
			count += 1
			n = n//i 
		if (count > 0): 
			pf.append(i) 
		# i += 2
	if n > 2:
		pf.append(n)
	return pf