

'''simple docstring'''






import sys

sys.set_int_max_str_digits(0)  # type: ignore


def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     int   )							->       bool:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[Any]					=	[0] * 1_1
      SCREAMING_SNAKE_CASE_				:      Optional[int]					=	[0] * 1_1

      # mark last 9 numbers
      for _ in range(9   ):
            SCREAMING_SNAKE_CASE_				:      List[str]					=	1
            SCREAMING_SNAKE_CASE_				:      Dict					=	number // 1_0
      # flag
      SCREAMING_SNAKE_CASE_				:      int					=	True

      # check last 9 numbers for pandigitality

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

      # mark first 9 numbers
      SCREAMING_SNAKE_CASE_				:      Optional[Any]					=	int(str(SCREAMING_SNAKE_CASE_   )[:9]   )

      for _ in range(9   ):
            SCREAMING_SNAKE_CASE_				:      str					=	1
            SCREAMING_SNAKE_CASE_				:      str					=	number // 1_0

      # check first 9 numbers for pandigitality

      for x in range(9   ):
            if not check_front[x + 1]:
                  SCREAMING_SNAKE_CASE_				:      Optional[int]					=	False
      return f


def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     int   )							->       bool:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      Any					=	[0] * 1_1

      # mark last 9 numbers
      for _ in range(9   ):
            SCREAMING_SNAKE_CASE_				:      str					=	1
            SCREAMING_SNAKE_CASE_				:      str					=	number // 1_0
      # flag
      SCREAMING_SNAKE_CASE_				:      Tuple					=	True

      # check last 9 numbers for pandigitality

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


def  __lowerCamelCase      (				)							->       int:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      Dict					=	1
      SCREAMING_SNAKE_CASE_				:      Any					=	1
      SCREAMING_SNAKE_CASE_				:      Tuple					=	2
      # temporary Fibonacci numbers

      SCREAMING_SNAKE_CASE_				:      Any					=	1
      SCREAMING_SNAKE_CASE_				:      int					=	1
      SCREAMING_SNAKE_CASE_				:      Tuple					=	2
      # temporary Fibonacci numbers mod 1e9

      # mod m=1e9, done for fast optimisation
      SCREAMING_SNAKE_CASE_				:      int					=	[0] * 1_0_0_0_0_0_0
      SCREAMING_SNAKE_CASE_				:      List[str]					=	1_0_0_0_0_0_0_0_0_0

      for x in range(1_0_0_0_0_0_0   ):
            SCREAMING_SNAKE_CASE_				:      Tuple					=	(aa + ba) % m
            SCREAMING_SNAKE_CASE_				:      Tuple					=	ba % m
            SCREAMING_SNAKE_CASE_				:      int					=	ca % m
            if checka(SCREAMING_SNAKE_CASE_   ):
                  SCREAMING_SNAKE_CASE_				:      Any					=	1

      for x in range(1_0_0_0_0_0_0   ):
            SCREAMING_SNAKE_CASE_				:      List[str]					=	a + b
            SCREAMING_SNAKE_CASE_				:      Dict					=	b
            SCREAMING_SNAKE_CASE_				:      int					=	c
            # perform check only if in tocheck
            if tocheck[x + 3] and check(SCREAMING_SNAKE_CASE_   ):
                  return x + 3  # first 2 already done
      return -1


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




'''simple docstring'''






def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     Optional[int]  ,  SCREAMING_SNAKE_CASE_					:     Tuple   )							->       List[str]:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[str]					=	(boundary[1] - boundary[0]) / steps
      SCREAMING_SNAKE_CASE_				:      Optional[Any]					=	boundary[0]
      SCREAMING_SNAKE_CASE_				:      int					=	boundary[1]
      SCREAMING_SNAKE_CASE_				:      List[Any]					=	make_points(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_   )
      SCREAMING_SNAKE_CASE_				:      Dict					=	0.0
      y += (h / 3.0) * f(SCREAMING_SNAKE_CASE_   )
      SCREAMING_SNAKE_CASE_				:      Tuple					=	2
      for i in x_i:
            y += (h / 3) * (4 - 2 * (cnt % 2)) * f(SCREAMING_SNAKE_CASE_   )
            cnt += 1
      y += (h / 3.0) * f(SCREAMING_SNAKE_CASE_   )
      return y


def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     Optional[Any]  ,  SCREAMING_SNAKE_CASE_					:     List[Any]  ,  SCREAMING_SNAKE_CASE_					:     Optional[Any]   )							->       List[Any]:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[Any]					=	a + h
      while x < (b - h):
            yield x
            SCREAMING_SNAKE_CASE_				:      List[Any]					=	x + h


def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     str   )							->       List[Any]:  # enter your function here
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[str]					=	(x - 0) * (x - 0)
      return y


def  __lowerCamelCase      (				)							->       int:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[Any]					=	0.0  # Lower bound of integration
      SCREAMING_SNAKE_CASE_				:      Optional[Any]					=	1.0  # Upper bound of integration
      SCREAMING_SNAKE_CASE_				:      str					=	10.0  # define number of steps or resolution
      SCREAMING_SNAKE_CASE_				:      List[Any]					=	[a, b]  # define boundary of integration
      SCREAMING_SNAKE_CASE_				:      List[str]					=	method_a(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_   )
      print(F"y = {y}"   )


if __name__ == "__main__":
      main()

