


"""simple docstring"""





def      _snake_case						(						_snake_case				:			Optional[Any]			):
      stooge(_snake_case ,   0 ,   len(_snake_case			) - 1			)
      return arr


def      _snake_case						(						_snake_case				:			Optional[int] ,   _snake_case				:			List[Any] ,   _snake_case				:			Optional[Any]			):
      if i >= h:
            return

      # If first element is smaller than the last then swap them
      if arr[i] > arr[h]:
            lowerCAmelCase,      lowerCAmelCase					:	Union[str, Any]       =   arr[h], arr[i]

      # If there are more than 2 elements in the array
      if h - i + 1 > 2:
            lowerCAmelCase					:	str       =   (int)((h - i + 1) / 3			)

            # Recursively sort first 2/3 elements
            stooge(_snake_case ,   _snake_case ,   (h - t)			)

            # Recursively sort last 2/3 elements
            stooge(_snake_case ,   i + t ,   (_snake_case)			)

            # Recursively sort first 2/3 elements
            stooge(_snake_case ,   _snake_case ,   (h - t)			)


if __name__ == "__main__":
 snake_case__		:     Any    				=				input('''Enter numbers separated by a comma:\n''').strip()
 snake_case__		:     Union[str, Any]    				=				[int(item) for item in user_input.split(''',''')]
 print(stooge_sort(unsorted))






"""simple docstring"""





def      _snake_case						(						_snake_case				:			int = 4000000			):
      lowerCAmelCase					:	int       =   [0, 1]
      lowerCAmelCase					:	List[str]       =   0
      while fib[i] <= n:
            fib.append(fib[i] + fib[i + 1]			)
            if fib[i + 2] > n:
                  break
            i += 1
      lowerCAmelCase					:	int       =   0
      for j in range(len(_snake_case			) - 1			):
            if fib[j] % 2 == 0:
                  total += fib[j]

      return total


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


