






def     lowerCamelCase__				(   __lowerCamelCase      :					int  ,		__lowerCamelCase      :					int		):
  __UpperCAmelCase							:     Any									=  1.0
  for i in range(1  ,		r + 1		):
    ret *= (n + 1 - i) / i
  return round(__lowerCamelCase		)






def     lowerCamelCase__				(   __lowerCamelCase      :					int		):
  return choose(8 + n  ,		__lowerCamelCase		) + choose(9 + n  ,		__lowerCamelCase		) - 10






def     lowerCamelCase__				(   __lowerCamelCase      :					int		):
  return sum(non_bouncy_exact(__lowerCamelCase		) for i in range(1  ,		n + 1		)		)






def     lowerCamelCase__				(   __lowerCamelCase      :					int = 100		):
  return non_bouncy_upto(__lowerCamelCase		)


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










def     lowerCamelCase__				(   __lowerCamelCase      :					list		):
  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()


