






def 					lowercase__				(					__snake_case   :							int = 1_000  ):


					'''simple docstring'''


					UpperCAmelCase_   :				List[Any]						=						2**power
					UpperCAmelCase_   :				Optional[Any]						=						0
					while n:
										UpperCAmelCase_	,  UpperCAmelCase_   :				List[Any]						=						r + n % 10, n // 10
					return r


if __name__ == "__main__":
		print(solution(int(str(input()).strip())))














from __future__ import annotations




def 					lowercase__				(					__snake_case   :							list[int]					,	__snake_case   :							int  ):


					'''simple docstring'''


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


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

		testmod()
		__UpperCAmelCase     							=						[randint(-1000, 1000) for i in range(100)]
		__UpperCAmelCase     							=						randint(0, 110)
		print(F'The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}')






