

def        __UpperCamelCase     (      _A					:							int = 4000000		)				->List[str]:



							"""simple docstring"""





							if n <= 1:
														return 0
							lowerCamelCase_								=0
							lowerCamelCase_								=2
							lowerCamelCase_								=0
							while 4 * b + a <= n:
														lowerCamelCase_								=b, 4 * b + a
														count += a
							return count + b


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





def 						_lowerCAmelCase    (					__lowerCamelCase :  list  ):



 """simple docstring"""





 if len(__lowerCamelCase  ) <= 1:
  return data
 else:
  return [
      *quick_sort([e for e in data[1:] if e <= data[0]]  ),
      data[0],
      *quick_sort([e for e in data[1:] if e > data[0]]  ),
  ]


if __name__ == "__main__":
      import doctest

      doctest.testmod()






