





"""simple docstring"""




def 		UpperCAmelCase__						(	_UpperCAmelCase					,   _UpperCAmelCase   ):






  """simple docstring"""





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





def 		UpperCAmelCase__						(	_UpperCAmelCase					,   _UpperCAmelCase					,   _UpperCAmelCase   ):






  """simple docstring"""





  A_    :			Optional[Any]									=    a + h
  while x < (b - h):
    yield x
    A_    :			Dict									=    x + h





def 		UpperCAmelCase__						(	_UpperCAmelCase   ):  # enter your function here






  """simple docstring"""





  A_    :			List[Any]									=    (x - 0) * (x - 0)
  return y





def 		UpperCAmelCase__						(	):






  """simple docstring"""





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


if __name__ == "__main__":
   main()


def      snake_case__							(  lowerCAmelCase_ = 100     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=[[0 for _ in range(lowerCAmelCase_     )] for _ in range(m + 1     )]
     for i in range(m + 1     ):
          SCREAMING_SNAKE_CASE 		=1

     for n in range(m + 1     ):
          for k in range(1,       lowerCAmelCase_     ):
               memo[n][k] += memo[n][k - 1]
               if n > k:
                    memo[n][k] += memo[n - k - 1][k]

     return memo[m][m - 1] - 1


if __name__ == "__main__":
 print(solution(int(input("Enter a number: ").strip())))

