





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) * 9 / 5) + 32,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round(float(a) + 2_7_3.1_5,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) * 9 / 5) + 4_9_1.6_7,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) - 32) * 5 / 9,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round(((float(a) - 32) * 5 / 9) + 2_7_3.1_5,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round(float(a) + 4_5_9.6_7,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round(float(a) - 2_7_3.1_5,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round(((float(a) - 2_7_3.1_5) * 9 / 5) + 32,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) * 9 / 5),  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) - 4_9_1.6_7) * 5 / 9,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round(float(a) - 4_5_9.6_7,  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) * 5 / 9),  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) * 1.2_5 + 2_7_3.1_5),  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) * 2.2_5 + 32),  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) * 1.2_5),  a)





def  __UpperCamelCase   (     a,  a = 2)			->float:
					return round((float(a) * 2.2_5 + 32 + 4_5_9.6_7),  a)


if __name__ == "__main__":
						import doctest

						doctest.testmod()








def  __UpperCamelCase   (     a = 998001)			->int:

					# fetches the next number
					for number in range(n - 1,  9999,  -1):
										lowerCamelCase__      =							str(a)

										# checks whether 'str_number' is a palindrome.
										if str_number == str_number[::-1]:
															lowerCamelCase__      =							999

															# 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() = }""")

