def  _lowerCamelCase					(   a_				: list[int]						,			a_				: str):
			lowerCamelCase						:Dict						  =     int(a_)

			# Initialize Result
			lowerCamelCase						:Dict						  =     []

			# 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__           =							[]
			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, 100, 500, 2_000]
						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=""" """)




import math





def  _lowerCamelCase					(   a_				: int):

			if 1 < number < 4:
						# 2 and 3 are primes
						return True
			elif number < 2 or number % 2 == 0 or number % 3 == 0:
						# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
						return False

			# All primes number are in format of 6k +/- 1
			for i in range(5						,			int(math.sqrt(a_) + 1)						,			6):
						if number % i == 0 or number % (i + 2) == 0:
									return False
			return True





def  _lowerCamelCase					(   a_				: float = 0.1):
			lowerCamelCase						:Dict						  =     3
			lowerCamelCase						:List[Any]						  =     3

			while primes / (2 * j - 1) >= ratio:
						for i in range(j * j + j + 1						,			(j + 2) * (j + 2)						,			j + 1):
									primes += is_prime(a_)
						j += 2
			return j


if __name__ == "__main__":
			import doctest

			doctest.testmod()



