



"""simple docstring"""






def 			snake_case		(		lowerCAmelCase_ = 200	)						->				int:
  _snake_case   	=      [1, 2, 5, 10, 20, 50, 100, 200]
  _snake_case   	=      [0] * (pence + 1)
  _snake_case   	=      1  # base case: 1 way to make 0 pence

  for coin in coins:
    for i in range(lowerCAmelCase_  ,						pence + 1  ,						1	):
      number_of_ways[i] += number_of_ways[i - coin]
  return number_of_ways[pence]


if __name__ == "__main__":
     assert solution(2_0_0) == 7_3_6_8_2









from __future__ import annotations
def 	_UpperCamelCase					(    lowerCAmelCase_	,    lowerCAmelCase_ )    ->Optional[int]:
   # Checks if the entire collection has been sorted
   if len(lowerCAmelCase_ ) <= 1 or n <= 1:
      return

   insert_next(lowerCAmelCase_	,    n - 1 )
   rec_insertion_sort(lowerCAmelCase_	,    n - 1 )
def 	_UpperCamelCase					(    lowerCAmelCase_	,    lowerCAmelCase_ )    ->Dict:
   # Checks order between adjacent elements
   if index >= len(lowerCAmelCase_ ) or collection[index - 1] <= collection[index]:
      return

   # Swaps adjacent elements since they are not in ascending order
   UpperCAmelCase					,	UpperCAmelCase      					=  (
       collection[index],
       collection[index - 1],
   )

   insert_next(lowerCAmelCase_	,    index + 1 )


if __name__ == "__main__":
 __a	 =      input("""Enter integers separated by spaces: """)
 __a	 =      [int(num) for num in numbers.split()]
 rec_insertion_sort(number_list, len(number_list))
 print(number_list)



