




'''simple docstring'''


def 						SCREAMING_SNAKE_CASE       (      a_	:							int				,					a_	:							Any				,					a_	:							int				,					a_	:							Optional[int]				,					a_	:							Optional[int]				,					a_	:							Tuple			):
  if index == r:
    for j in range(a_			):
      print(data[j]				,					end=' '			)
    print(' '			)
    return
  #  When no more elements are there to put in data[]
  if i >= n:
    return
  # current is included, put next at next location
  __a			=					arr[i]
  combination_util(a_				,					a_				,					a_				,					index + 1				,					a_				,					i + 1			)
  # current is excluded, replace it with
  # next (Note that i+1 is passed, but
  # index is not changed)
  combination_util(a_				,					a_				,					a_				,					a_				,					a_				,					i + 1			)
  # The main function that prints all combinations
  # of size r in arr[] of size n. This function
  # mainly uses combinationUtil()


def 						SCREAMING_SNAKE_CASE       (      a_	:							List[Any]				,					a_	:							Dict				,					a_	:							Union[str, Any]			):
  # A temporary array to store all combination one by one
  __a			=					[0] * r
  # Print all combination using temporary array 'data[]'
  combination_util(a_				,					a_				,					a_				,					0				,					a_				,					0			)


if __name__ == "__main__":
  # Driver code to check the function above
  UpperCAmelCase_ 		=      [10, 20, 30, 40, 50]
  print_combination(arr, len(arr), 3)
  # This code is contributed by Ambuj sahu









'''simple docstring'''


def 						SCREAMING_SNAKE_CASE       (      a_	:							int = 10**12			):
  __a			=					1
  __a			=					0

  __a			=					1
  __a			=					1

  while numerator <= 2 * min_total - 1:
    prev_numerator += 2 * numerator
    numerator += 2 * prev_numerator

    prev_denominator += 2 * denominator
    denominator += 2 * prev_denominator

  return (denominator + 1) // 2


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



