

from functools import lru_cache

def        lowerCamelCase__       (    _a):
	SCREAMING_SNAKE_CASE      :					str    =				2
	SCREAMING_SNAKE_CASE      :					Optional[Any]    =				set()
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.add(_a)
	if n > 1:
		factors.add(_a)
	return factors

@lru_cache
def        lowerCamelCase__       (    _a):
	return len(unique_prime_factors(_a))

def        lowerCamelCase__       (    _a):
	return len(set(_a)) in (0, 1)

def        lowerCamelCase__       (    _a):
	SCREAMING_SNAKE_CASE      :					Any    =				2

	while True:
		# Increment each value of a generated range
		SCREAMING_SNAKE_CASE      :					Union[str, Any]    =				[base + i for i in range(_a)]

		# Run elements through out unique_prime_factors function
		# Append our target number to the end.
		SCREAMING_SNAKE_CASE      :					List[str]    =				[upf_len(_a) for x in group]
		checker.append(_a)

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

		# Increment our base variable by 1
		base += 1

def        lowerCamelCase__       (    _a = 4):
	SCREAMING_SNAKE_CASE      :					Tuple    =				run(_a)
	return results[0] if len(_a) else None


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


from __future__ import annotations






def        UpperCamelCase_(							_snake_case   :  int	):




			"""simple docstring"""






			__a        =str(_snake_case	)
			return len(_snake_case	) == 9 and set(_snake_case	) == set('123456789'	)






def        UpperCamelCase_(							):




			"""simple docstring"""






			for base_num in range(9999       ,     4999       ,     -1	):
						__a        =100002 * base_num
						if is_9_pandigital(_snake_case	):
									return candidate

			for base_num in range(333       ,     99       ,     -1	):
						__a        =1002003 * base_num
						if is_9_pandigital(_snake_case	):
									return candidate

			return None


if __name__ == "__main__":
						print(f'''{solution() = }''')






