

"""simple docstring"""




import sys

sys.set_int_max_str_digits(0)  # type: ignore
def   __SCREAMING_SNAKE_CASE		(		lowercase__ ):
					"""simple docstring"""
					A     =   [0] * 11
					A     =   [0] * 11

					# mark last 9 numbers
					for _ in range(9 ):
										A     =   1
										A     =   number // 10
					# flag
					A     =   True

					# check last 9 numbers for pandigitality

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

					# mark first 9 numbers
					A     =   int(str(lowercase__ )[:9] )

					for _ in range(9 ):
										A     =   1
										A     =   number // 10

					# check first 9 numbers for pandigitality

					for x in range(9 ):
										if not check_front[x + 1]:
															A     =   False
					return f
def   __SCREAMING_SNAKE_CASE		(		lowercase__ ):
					"""simple docstring"""
					A     =   [0] * 11

					# mark last 9 numbers
					for _ in range(9 ):
										A     =   1
										A     =   number // 10
					# flag
					A     =   True

					# check last 9 numbers for pandigitality

					for x in range(9 ):
										if not check_last[x + 1]:
															A     =   False
					return f
def   __SCREAMING_SNAKE_CASE		(		):
					"""simple docstring"""
					A     =   1
					A     =   1
					A     =   2
					# temporary Fibonacci numbers

					A     =   1
					A     =   1
					A     =   2
					# temporary Fibonacci numbers mod 1e9

					# mod m=1e9, done for fast optimisation
					A     =   [0] * 1_000_000
					A     =   1_000_000_000

					for x in range(1_000_000 ):
										A     =   (aa + ba) % m
										A     =   ba % m
										A     =   ca % m
										if checka(lowercase__ ):
															A     =   1

					for x in range(1_000_000 ):
										A     =   a + b
										A     =   b
										A     =   c
										# perform check only if in tocheck
										if tocheck[x + 3] and check(lowercase__ ):
															return x + 3  # first 2 already done
					return -1


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










def 						_lowerCAmelCase    (					__lowerCamelCase :  int  ):



 """simple docstring"""





 if not isinstance(__lowerCamelCase		,						__lowerCamelCase  ):
  __SCREAMING_SNAKE_CASE							:     Union[str, Any]							=						(
      "operation can not be conducted on a object of type "
      F"""{type(__lowerCamelCase  ).__name__}"""
  )
  raise TypeError(__lowerCamelCase  )
 __SCREAMING_SNAKE_CASE							:     List[str]							=						""
 for _ in range(0		,						32  ):
  bit_string += str(number % 2  )
  __SCREAMING_SNAKE_CASE							:     Union[str, Any]							=						number >> 1
 return bit_string






def 						_lowerCAmelCase    (					__lowerCamelCase :  int  ):



 """simple docstring"""





 if number < 0:
  raise ValueError("the value of input must be positive"  )
 elif isinstance(__lowerCamelCase		,						__lowerCamelCase  ):
  raise TypeError("Input value must be a 'int' type"  )
 elif isinstance(__lowerCamelCase		,						__lowerCamelCase  ):
  raise TypeError("'<' not supported between instances of 'str' and 'int'"  )
 __SCREAMING_SNAKE_CASE							:     Any							=						0
 # iterator over [1 to 32],since we are dealing with 32 bit integer
 for _ in range(1		,						33  ):
  # left shift the bits by unity
  __SCREAMING_SNAKE_CASE							:     Optional[int]							=						result << 1
  # get the end bit
  __SCREAMING_SNAKE_CASE							:     Union[str, Any]							=						number % 2
  # right shift the bits by unity
  __SCREAMING_SNAKE_CASE							:     Optional[Any]							=						number >> 1
  # add that bit to our ans
  __SCREAMING_SNAKE_CASE							:     Optional[int]							=						result | end_bit
 return get_reverse_bit_string(__lowerCamelCase  )


if __name__ == "__main__":
      import doctest

      doctest.testmod()






