"""simple docstring"""




def 							SCREAMING_SNAKE_CASE					(      _lowerCamelCase						:	list[int]      ,_lowerCamelCase						:	str     )	->				list[int]:
  _lowerCAmelCase						:	Tuple        =					int(_lowerCamelCase     )

  # Initialize Result
  _lowerCAmelCase						:	Optional[int]        =					[]

  # Traverse through all denomination
  for denomination in reversed(_lowerCamelCase     ):
    # Find denominations
    while int(_lowerCamelCase     ) >= int(_lowerCamelCase     ):
      total_value -= int(_lowerCamelCase     )
      answer.append(_lowerCamelCase     )  # Append the "answers" array

  return answer


# Driver Code
if __name__ == "__main__":
     _a				:		Tuple	   =       []
     _a				:		Any	   =       '0'

     if (
         input('Do you want to enter your denominations ? (yY/n): ').strip().lower()
         == "y"
     ):
          _a				:		Any	   =       int(input('Enter the number of denominations you want to add: ').strip())

          for i in range(0, n):
               denominations.append(int(input(F"""Denomination {i}: """).strip()))
          _a				:		Dict	   =       input('Enter the change you want to make in Indian Currency: ').strip()
     else:
          # All denominations of Indian Currency if user does not enter
          _a				:		List[Any]	   =       [1, 2, 5, 10, 20, 50, 100, 500, 2_000]
          _a				:		Optional[Any]	   =       input('Enter the change you want to make: ').strip()

     if int(value) == 0 or int(value) < 0:
          print('The total value cannot be zero or negative.')

     else:
          print(F"""Following is minimal change for {value}: """)
          _a				:		int	   =       find_minimum_change(denominations, value)
          # Print result
          for i in range(len(answer)):
               print(answer[i], end=' ')





"""simple docstring"""




def 							SCREAMING_SNAKE_CASE					(      _lowerCamelCase						:	int = 100     )	->				int:
  _lowerCAmelCase						:	Optional[Any]        =					n * (n + 1) * (2 * n + 1) / 6
  _lowerCAmelCase						:	Tuple        =					(n * (n + 1) / 2) ** 2
  return int(square_of_sum - sum_of_squares     )


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




