


'''simple docstring'''
import math


def 			a      (			__a   )  ->	bool:



					'''simple docstring'''






					assert isinstance(__a ,					__a   ) and (
					    number >= 0
					), "'number' must been an int and positive"

					if 1 < number < 4:
										# 2 and 3 are primes
										return True
					elif number < 2 or not number % 2:
										# Negatives, 0, 1 and all even numbers are not primes
										return False

					UpperCamelCase__   :List[str]												= range(3 ,					int(math.sqrt(__a   ) + 1   ) ,					2   )
					return not any(not number % i for i in odd_numbers   )







def 			a      (			__a ,					__a=1 ,					**__a   )  ->	Optional[Any]:



					'''simple docstring'''






					UpperCamelCase__   :Tuple												= factor * value
					UpperCamelCase__   :List[Any]												= value

					while not is_prime(__a   ):
										value += 1 if not ("desc" in kwargs and kwargs["desc"] is True) else -1

					if value == first_value_val:
										return next_prime(value + 1 ,					**__a   )
					return value



'''simple docstring'''
def 			a      (			)  ->	Union[str, Any]:



					'''simple docstring'''






					UpperCamelCase__   :Optional[int]												= []
					UpperCamelCase__   :int												= 1

					while len(__a   ) < 1e6:
										constant.append(str(__a   )   )
										i += 1

					UpperCamelCase__   :Union[str, Any]												= ''''''.join(__a   )

					return (
					    int(constant[0]   )
					    * int(constant[9]   )
					    * int(constant[99]   )
					    * int(constant[999]   )
					    * int(constant[9999]   )
					    * int(constant[99999]   )
					    * int(constant[999999]   )
					)


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