
def 				a						(							snake_case__:					int = 1_000					):


				'''simple docstring'''
				lowercase_       =					2**power
				lowercase_       =					0
				while n:
								lowercase_  ,	lowercase_       =					r + n % 10, n // 10
				return r


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






def 				a						(							snake_case__:					list						,   snake_case__:					list						,   snake_case__:					int						,   snake_case__:					int						,   snake_case__:					int					):


				'''simple docstring'''
				if index == number_of_items:
								return 0
				lowercase_       =					0
				lowercase_       =					0
				lowercase_       =					knapsack(snake_case__						,   snake_case__						,   snake_case__						,   snake_case__						,   index + 1					)
				if weights[index] <= max_weight:
								lowercase_       =					values[index] + knapsack(
								    snake_case__						,   snake_case__						,   snake_case__						,   max_weight - weights[index]						,   index + 1					)
				return max(snake_case__						,   snake_case__					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()




