



'''simple docstring'''
from __future__ import annotations






def A__       (	UpperCAmelCase_    ,    UpperCAmelCase_				):
						if len(UpperCAmelCase_				) < k or k < 0:
												raise ValueError('Invalid Input'				)
						_UpperCamelCase   :						Optional[Any]												=  sum(array[:k]				)
						for i in range(len(UpperCAmelCase_				) - k				):
												_UpperCamelCase   :						Optional[Any]												=  current_sum - array[i] + array[i + k]
												_UpperCamelCase   :						Tuple												=  max(UpperCAmelCase_    ,    UpperCAmelCase_				)
						return max_sum


if __name__ == "__main__":
					from doctest import testmod
					from random import randint

					testmod()
					snake_case_					:      Optional[Any]    			=    [randint(-1000, 1000) for i in range(100)]
					snake_case_					:      List[str]    			=    randint(0, 110)
					print(F"""The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}""")







'''simple docstring'''
def A__       (	UpperCAmelCase_ = 6_0_0_8_5_1_4_7_5_1_4_3				):

						try:
												_UpperCamelCase   :						str												=  int(UpperCAmelCase_				)
						except (TypeError, ValueError):
												raise TypeError('Parameter n must be int or castable to int.'				)
						if n <= 0:
												raise ValueError('Parameter n must be greater than or equal to one.'				)
						_UpperCamelCase   :						int												=  1
						_UpperCamelCase   :						Optional[Any]												=  2
						while i * i <= n:
												while n % i == 0:
																		_UpperCamelCase   :						Union[str, Any]												=  i
																		n //= i
												i += 1
						if n > 1:
												_UpperCamelCase   :						Dict												=  n
						return int(UpperCAmelCase_				)


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


