'''simple docstring'''




import sys

sys.set_int_max_str_digits(0)  # type: ignore




def 				lowerCamelCase      ( UpperCAmelCase__			:   int					)     -> bool:
							lowercase_   :     Optional[int]									=			[0] * 11
							lowercase_   :     Optional[int]									=			[0] * 11

							# mark last 9 numbers
							for _ in range(9					):
														lowercase_   :     Any									=			1
														lowercase_   :     List[Any]									=			number // 10
							# flag
							lowercase_   :     Tuple									=			True

							# check last 9 numbers for pandigitality

							for x in range(9					):
														if not check_last[x + 1]:
																					lowercase_   :     Tuple									=			False
							if not f:
														return f

							# mark first 9 numbers
							lowercase_   :     Any									=			int(str(UpperCAmelCase__					)[:9]					)

							for _ in range(9					):
														lowercase_   :     Union[str, Any]									=			1
														lowercase_   :     Optional[Any]									=			number // 10

							# check first 9 numbers for pandigitality

							for x in range(9					):
														if not check_front[x + 1]:
																					lowercase_   :     Any									=			False
							return f




def 				lowerCamelCase      ( UpperCAmelCase__			:   int					)     -> bool:
							lowercase_   :     List[Any]									=			[0] * 11

							# mark last 9 numbers
							for _ in range(9					):
														lowercase_   :     str									=			1
														lowercase_   :     int									=			number // 10
							# flag
							lowercase_   :     Any									=			True

							# check last 9 numbers for pandigitality

							for x in range(9					):
														if not check_last[x + 1]:
																					lowercase_   :     List[Any]									=			False
							return f




def 				lowerCamelCase      ( )     -> int:
							lowercase_   :     List[Any]									=			1
							lowercase_   :     List[str]									=			1
							lowercase_   :     Optional[Any]									=			2
							# temporary Fibonacci numbers

							lowercase_   :     int									=			1
							lowercase_   :     Union[str, Any]									=			1
							lowercase_   :     Union[str, Any]									=			2
							# temporary Fibonacci numbers mod 1e9

							# mod m=1e9, done for fast optimisation
							lowercase_   :     List[Any]									=			[0] * 1000000
							lowercase_   :     Tuple									=			1000000000

							for x in range(1000000					):
														lowercase_   :     Any									=			(aa + ba) % m
														lowercase_   :     Any									=			ba % m
														lowercase_   :     str									=			ca % m
														if checka(UpperCAmelCase__					):
																					lowercase_   :     Optional[Any]									=			1

							for x in range(1000000					):
														lowercase_   :     Dict									=			a + b
														lowercase_   :     int									=			b
														lowercase_   :     Optional[int]									=			c
														# perform check only if in tocheck
														if tocheck[x + 3] and check(UpperCAmelCase__					):
																					return x + 3  # first 2 already done
							return -1


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






'''simple docstring'''




_lowercase		:					List[str]													=		"\n# Diffusers installation\n! pip install diffusers transformers datasets accelerate\n# To install from source instead of the last release, comment the command above and uncomment the following one.\n# ! pip install git+https://github.com/huggingface/diffusers.git\n"

_lowercase		:					Union[str, Any]													=		[{"type": "code", "content": INSTALL_CONTENT}]





