


'''simple docstring'''






import math


def 					_snake_case   (     A       )						->    list:
							if n <= 0:
														raise ValueError('''Only positive integers have prime factors'''       )
							lowerCAmelCase__          =	[]
							while n % 2 == 0:
														pf.append(2       )
														lowerCAmelCase__          =	int(n / 2       )
							for i in range(3 ,    int(math.sqrt(A       )       ) + 1 ,    2       ):
														while n % i == 0:
																					pf.append(A       )
																					lowerCAmelCase__          =	int(n / i       )
							if n > 2:
														pf.append(A       )
							return pf


def 					_snake_case   (     A       )						->    int:
							if n <= 0:
														raise ValueError('''Only positive numbers are accepted'''       )
							lowerCAmelCase__          =	1
							lowerCAmelCase__          =	1
							while n % 2 == 0:
														temp += 1
														lowerCAmelCase__          =	int(n / 2       )
							div *= temp
							for i in range(3 ,    int(math.sqrt(A       )       ) + 1 ,    2       ):
														lowerCAmelCase__          =	1
														while n % i == 0:
																					temp += 1
																					lowerCAmelCase__          =	int(n / i       )
														div *= temp
							if n > 1:
														div *= 2
							return div


def 					_snake_case   (     A       )						->    int:
							if n <= 0:
														raise ValueError('''Only positive numbers are accepted'''       )
							lowerCAmelCase__          =	1
							lowerCAmelCase__          =	1
							while n % 2 == 0:
														temp += 1
														lowerCAmelCase__          =	int(n / 2       )
							if temp > 1:
														s *= (2**temp - 1) / (2 - 1)
							for i in range(3 ,    int(math.sqrt(A       )       ) + 1 ,    2       ):
														lowerCAmelCase__          =	1
														while n % i == 0:
																					temp += 1
																					lowerCAmelCase__          =	int(n / i       )
														if temp > 1:
																					s *= (i**temp - 1) / (i - 1)
							return int(A       )


def 					_snake_case   (     A       )						->    int:
							lowerCAmelCase__          =	n
							for x in set(prime_factors(A       )       ):
														s *= (x - 1) / x
							return int(A       )


if __name__ == "__main__":
		import doctest

		doctest.testmod()



'''simple docstring'''






def 					_snake_case   (     A ,    A       )						->    float:
							return a + b


if __name__ == "__main__":
		__UpperCAmelCase    				=							5
		__UpperCAmelCase    				=							6
		print(f"""The sum of {a} + {b} is {add(a, b)}""")