



def 	_lowerCAmelCase (    A__    ,	A__						):
      lowercase__  =	int(A__						)

      # Initialize Result
      lowercase__  =	[]

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

      return answer


# Driver Code
if __name__ == "__main__":
       a__   :					Optional[int] 						=      []
       a__   :					Dict 						=      "0"

       if (
           input("Do you want to enter your denominations ? (yY/n): ").strip().lower()
           == "y"
       ):
              a__   :					Tuple 						=      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__   :					Dict 						=      [1, 2, 5, 10, 20, 50, 1_00, 5_00, 20_00]
              a__   :					str 						=      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__   :					Optional[Any] 						=      find_minimum_change(denominations, value)
              # Print result
              for i in range(len(answer)):
                     print(answer[i], end=" ")


def 				__A(lowerCAmelCase			)		->					bool:

		"""simple docstring"""






		if not isinstance(lowerCAmelCase    ,	lowerCAmelCase			):
				raise ValueError("""check_bouncy() accepts only integer arguments"""			)
		_UpperCamelCase         =						str(lowerCAmelCase			)
		_UpperCamelCase         =						"""""".join(sorted(lowerCAmelCase			)			)
		return sorted_str_n != str_n and sorted_str_n[::-1] != str_n


def 				__A(lowerCAmelCase = 9_9			)		->					int:

		"""simple docstring"""






		if not 0 < percent < 1_0_0:
				raise ValueError("""solution() only accepts values from 0 to 100"""			)
		_UpperCamelCase         =						0
		_UpperCamelCase         =						1

		while True:
				if check_bouncy(lowerCAmelCase			):
						bouncy_num += 1
				if (bouncy_num / num) * 1_0_0 >= percent:
						return num
				num += 1


if __name__ == "__main__":
		from doctest import testmod

		testmod()
		print(F"""{solution(99)}""")



