






'''simple docstring'''

def 					lowercase__				(   __UpperCamelCase					)->				list:
      if any(not isinstance(__UpperCamelCase	,		__UpperCamelCase					) or x < 0 for x in sequence					):
            raise TypeError("""Sequence must be list of non-negative integers"""					)
      for _ in range(len(__UpperCamelCase					)					):
            for i, (rod_upper, rod_lower) in enumerate(zip(__UpperCamelCase	,		sequence[1:]					)					):
                  if rod_upper > rod_lower:
                        sequence[i] -= rod_upper - rod_lower
                        sequence[i + 1] += rod_upper - rod_lower
      return sequence


if __name__ == "__main__":
     assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
     assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]








'''simple docstring'''

from math import factorial







def 					lowercase__				(   __UpperCamelCase = 20					)->				int:
      UpperCamelCase       						=      2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
      # 2, 3,...
      UpperCamelCase       						=      n // 2

      return int(factorial(__UpperCamelCase					) / (factorial(__UpperCamelCase					) * factorial(n - k					))					)


if __name__ == "__main__":
     import sys

     if len(sys.argv) == 1:
          print(solution(2_0))
     else:
          try:
               SCREAMING_SNAKE_CASE__											=     int(sys.argv[1])
               print(solution(n))
          except ValueError:
               print('Invalid entry - please enter a number.')
