





def    _lowercase    (  _UpperCAmelCase	,					_UpperCAmelCase )  ->     int:
				if n < 0:
								return 0
				# table[i] represents the number of ways to get to amount i
				lowerCamelCase		       =[0] * (n + 1)

				# There is exactly 1 way to get to zero(You pick no coins).
				lowerCamelCase		       =1

				# Pick all coins one by one and update table[] values
				# after the index greater than or equal to the value of the
				# picked coin
				for coin_val in s:
								for j in range(_UpperCAmelCase	,					n + 1 ):
												table[j] += table[j - coin_val]

				return table[n]


if __name__ == "__main__":
							import doctest

							doctest.testmod()












def    _lowercase    (  _UpperCAmelCase = 99_80_01 )  ->     int:

				# fetches the next number
				for number in range(n - 1	,					99_99	,					-1 ):
								lowerCamelCase		       =str(_UpperCAmelCase )

								# checks whether 'str_number' is a palindrome.
								if str_number == str_number[::-1]:
												lowerCamelCase		       =9_99

												# if 'number' is a product of two 3-digit numbers
												# then number is the answer otherwise fetch next number.
												while divisor != 99:
																if (number % divisor == 0) and (len(str(number // divisor ) ) == 3.0):
																				return number
																divisor -= 1
				raise ValueError("""That number is larger than our acceptable range.""" )


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





