





from __future__ import annotations





def  __UpperCamelCase   (     a,  a,  a,  )			->list[float | int]:
					if not all((nth_term, start_term_a, common_ratio_r)):
										return []
					lowerCamelCase__      =							[]
					lowerCamelCase__      =							1
					lowerCamelCase__      =							common_ratio_r
					for _ in range(int(a)):
										if not series:
															series.append(a)
										else:
															power += 1
															series.append(float(start_term_a * multiple))
															lowerCamelCase__      =							pow(float(a),  a)
					return series


if __name__ == "__main__":
						import doctest

						doctest.testmod()

						A_        =  float(input("Enter the last number (n term) of the Geometric Series"))
						A_        =  float(input("Enter the starting term (a) of the Geometric Series"))
						A_        =  float(
						    input("Enter the common ratio between two terms (r) of the Geometric Series")
						)
						print("Formula of Geometric Series => a + ar + ar^2 ... +ar^n")
						print(geometric_series(nth_term, start_term_a, common_ratio_r))








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

