



from __future__ import annotations





def 				A      (	_UpperCAmelCase							:  float | int				,  _UpperCAmelCase							:  float | int				,  _UpperCAmelCase							:  float | int				,  )							->					list[float | int]:







			'''simple docstring'''
			if not all((nth_term, start_term_a, common_ratio_r)       ):
						return []
			_UpperCAmelCase									=  []
			_UpperCAmelCase									=  1
			_UpperCAmelCase									=  common_ratio_r
			for _ in range(int(_UpperCAmelCase       )       ):
						if not series:
									series.append(_UpperCAmelCase       )
						else:
									power += 1
									series.append(float(start_term_a * multiple       )       )
									_UpperCAmelCase									=  pow(float(_UpperCAmelCase       )				,  _UpperCAmelCase       )
			return series


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							UpperCAmelCase__  =			float(input("Enter the last number (n term) of the Geometric Series"))
							UpperCAmelCase__  =			float(input("Enter the starting term (a) of the Geometric Series"))
							UpperCAmelCase__  =			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))





UpperCAmelCase__  =			10**8





def 				A      (	_UpperCAmelCase							:  int       )							->					bool:







			'''simple docstring'''
			if n % 10 == 0:
						return False
			_UpperCAmelCase									=  str(_UpperCAmelCase       )
			return s == s[::-1]





def 				A      (	)							->					int:







			'''simple docstring'''
			_UpperCAmelCase									=  set()
			_UpperCAmelCase									=  1
			_UpperCAmelCase									=  5
			while sum_squares < LIMIT:
						_UpperCAmelCase									=  first_square + 1
						while sum_squares < LIMIT:
									if is_palindrome(_UpperCAmelCase       ):
												answer.add(_UpperCAmelCase       )
									last_square += 1
									sum_squares += last_square**2
						first_square += 1
						_UpperCAmelCase									=  first_square**2 + (first_square + 1) ** 2

			return sum(_UpperCAmelCase       )


if __name__ == "__main__":
							print(solution())
