


"""simple docstring"""


from functools import lru_cache






def      a__ (				__lowercase   )	->	set:
				_A					  =			2
				_A					  =			set()
				while i * i <= n:
								if n % i:
												i += 1
								else:
												n //= i
												factors.add(__lowercase   )
				if n > 1:
								factors.add(__lowercase   )
				return factors






@lru_cache
def      a__ (				__lowercase   )	->	int:
				return len(unique_prime_factors(__lowercase   )   )






def      a__ (				__lowercase   )	->	bool:
				return len(set(__lowercase   )   ) in (0, 1)






def      a__ (				__lowercase   )	->	list:
				_A					  =			2

				while True:
								# Increment each value of a generated range
								_A					  =			[base + i for i in range(__lowercase   )]

								# Run elements through out unique_prime_factors function
								# Append our target number to the end.
								_A					  =			[upf_len(__lowercase   ) for x in group]
								checker.append(__lowercase   )

								# If all numbers in the list are equal, return the group variable.
								if equality(__lowercase   ):
												return group

								# Increment our base variable by 1
								base += 1






def      a__ (				__lowercase = 4   )	->	int:
				_A					  =			run(__lowercase   )
				return results[0] if len(__lowercase   ) else None


if __name__ == "__main__":
		print(solution())



"""simple docstring"""


import numpy as np






def      a__ (				__lowercase     ,			__lowercase   )	->	np.ndarray:
				return np.where(vector > 0     ,			__lowercase     ,			(alpha * (np.exp(__lowercase   ) - 1))   )


if __name__ == "__main__":
		import doctest

		doctest.testmod()