




from __future__ import annotations




def 		lowerCAmelCase_ (						lowerCamelCase ):

				# preprocessing the first row
				for i in range(1						,  len(matrix[0] ) ):
								matrix[0][i] += matrix[0][i - 1]

				# preprocessing the first column
				for i in range(1						,  len(lowerCamelCase ) ):
								matrix[i][0] += matrix[i - 1][0]

				# updating the path cost for current position
				for i in range(1						,  len(lowerCamelCase ) ):
								for j in range(1						,  len(matrix[0] ) ):
												matrix[i][j] += min(matrix[i - 1][j]						,  matrix[i][j - 1] )

				return matrix[-1][-1]


if __name__ == "__main__":
							import doctest

							doctest.testmod()







def    __lowerCamelCase      (					UpperCamelCase__ = 1000 ):







							'''simple docstring'''






							snake_case_     							=       2**power
							snake_case_     							=       0
							while n:
														snake_case_							,       snake_case_     							=       r + n % 10, n // 10
							return r


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




