




"""simple docstring"""


def       UpperCAmelCase__ (snake_case__							:      list[int]	,     snake_case__							:      str					):
  """simple docstring"""

  _snake_case							:	str			=						int(snake_case__					)

  # Initialize Result
  _snake_case							:	str			=						[]

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

  return answer


# Driver Code
if __name__ == "__main__":
     A_      			=       []
     A_      			=       '''0'''

     if (
         input('''Do you want to enter your denominations ? (yY/n): ''').strip().lower()
         == "y"
     ):
          A_      			=       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_      			=       input('''Enter the change you want to make in Indian Currency: ''').strip()
     else:
          # All denominations of Indian Currency if user does not enter
          A_      			=       [1, 2, 5, 10, 20, 50, 1_00, 5_00, 20_00]
          A_      			=       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_      			=       find_minimum_change(denominations, value)
          # Print result
          for i in range(len(answer)):
               print(answer[i], end=''' ''')








"""simple docstring"""


def       UpperCAmelCase__ (snake_case__							:      int					):
  """simple docstring"""

  if not isinstance(snake_case__	,     snake_case__					) or number < 0:
    raise ValueError("""Input must be a non-negative integer"""					)

  _snake_case							:	Dict			=						0
  while number:
    # This way we arrive at next set bit (next 1) instead of looping
    # through each bit and checking for 1s hence the
    # loop won't run 32 times it will only run the number of `1` times
    number &= number - 1
    count += 1
  return count


if __name__ == "__main__":
     import doctest

     doctest.testmod()


