
def     UpperCAmelCase_  (						__lowerCAmelCase	,					__lowerCAmelCase	) ->						list[int]:
    __lowercase		:			List[Any]	    =       int(__lowerCAmelCase	)

    # Initialize Result
    __lowercase		:			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__":
 __lowerCAmelCase					:			List[Any]			      =		[]
 __lowerCAmelCase					:			Tuple			      =		"0"

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




from math import factorial

__lowerCAmelCase					:			Dict			      =		{str(d): factorial(d) for d in range(10)}


def     UpperCAmelCase_  (						__lowerCAmelCase	) ->						int:
    return sum(DIGIT_FACTORIAL[d] for d in str(__lowerCAmelCase	)	)


def     UpperCAmelCase_  (						) ->						int:
    __lowercase		:			int	    =       7 * factorial(9	) + 1
    return sum(i for i in range(3	,					__lowerCAmelCase	) if sum_of_digit_factorial(__lowerCAmelCase	) == i	)


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


