'''simple docstring'''

def 							UpperCamelCase__			(			a__ = 1_0_0_0      ):


						'''simple docstring'''






						_lowerCAmelCase										=2**power
						_lowerCAmelCase										=0
						while n:
												_lowerCAmelCase						,				_lowerCAmelCase										=r + n % 1_0, n // 1_0
						return r


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






'''simple docstring'''

from __future__ import annotations



def 							UpperCamelCase__			(			a__      ):


						'''simple docstring'''






						_lowerCAmelCase										=len(a__      ) // 2

						# choose the middle 3 elements
						_lowerCAmelCase										=lst[m - 1 : m + 2]

						# if middle element is peak
						if three[1] > three[0] and three[1] > three[2]:
												return three[1]

						# if increasing, recurse on right
						elif three[0] < three[2]:
												if len(lst[:m]      ) == 2:
																		m -= 1
												return peak(lst[m:]      )

						# decreasing
						else:
												if len(lst[:m]      ) == 2:
																		m += 1
												return peak(lst[:m]      )


if __name__ == "__main__":
							import doctest

							doctest.testmod()





