
import itertools




def 		A						(  SCREAMING_SNAKE_CASE = 1000000							):




			"""simple docstring"""


			UpperCAmelCase__		:Tuple 		=    [1]

			for i in itertools.count(len(SCREAMING_SNAKE_CASE							)							):
						UpperCAmelCase__		:Optional[int] 		=    0
						for j in itertools.count(1							):
									UpperCAmelCase__		:List[str] 		=    -1 if j % 2 == 0 else +1
									UpperCAmelCase__		:Any 		=    (j * j * 3 - j) // 2
									if index > i:
												break
									item += partitions[i - index] * sign
									item %= number
									index += j
									if index > i:
												break
									item += partitions[i - index] * sign
									item %= number

						if item == 0:
									return i
						partitions.append(SCREAMING_SNAKE_CASE							)

			return 0


if __name__ == "__main__":
						import doctest

						doctest.testmod()

						print(f"""{solution() = }""")










def        a( A			:       int					,	A			:       int					,	A			:       int			)						->			float:
					"""simple docstring"""





					if common_ratio == 1:
										# Formula for sum if common ratio is 1
										return num_of_terms * first_term

					# Formula for finding sum of n terms of a GeometricProgression
					return (first_term / (1 - common_ratio)) * (1 - common_ratio**num_of_terms)
