




def 			_SCREAMING_SNAKE_CASE			(							lowercase	:       dict     ):


      '''simple docstring'''



      lowerCamelCase_		     =    set()
      # To detect a back edge, keep track of vertices currently in the recursion stack
      lowerCamelCase_		     =    set()
      return any(
          node not in visited and depth_first_search(lowercase	,							lowercase	,							lowercase	,							lowercase     )
          for node in graph     )

def 			_SCREAMING_SNAKE_CASE			(							lowercase	:       dict	,							lowercase	:       int	,							lowercase	:       set	,							lowercase	:       set     ):


      '''simple docstring'''



      visited.add(lowercase     )
      rec_stk.add(lowercase     )

      for node in graph[vertex]:
            if node not in visited:
                  if depth_first_search(lowercase	,							lowercase	,							lowercase	,							lowercase     ):
                        return True
            elif node in rec_stk:
                  return True

    # The node needs to be removed from recursion stack before function ends
      rec_stk.remove(lowercase     )
      return False


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

 testmod()









def 			_SCREAMING_SNAKE_CASE			(							lowercase	:       int = 10_00     ):


      '''simple docstring'''



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


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



