from __future__ import annotations


def      a__ (		__UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase				):
      if len(__UpperCamelCase				) == 0:
            raise ValueError("find_max() arg is an empty sequence"				)
      if (
          left >= len(__UpperCamelCase				)
          or left < -len(__UpperCamelCase				)
          or right >= len(__UpperCamelCase				)
          or right < -len(__UpperCamelCase				)
      ):
            raise IndexError("list index out of range"				)
      if left == right:
            return nums[left]
      SCREAMING_SNAKE_CASE_          =  (left + right) >> 1  # the middle
      SCREAMING_SNAKE_CASE_          =  find_max(__UpperCamelCase     ,      __UpperCamelCase     ,      __UpperCamelCase				)  # find max in range[left, mid]
      SCREAMING_SNAKE_CASE_          =  find_max(__UpperCamelCase     ,      mid + 1     ,      __UpperCamelCase				)  # find max in range[mid + 1, right]

      return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
      import doctest

      doctest.testmod(verbose=True)



from math import factorial


def      a__ (		__UpperCamelCase = 1_0_0				):
      return sum(int(__UpperCamelCase				) for x in str(factorial(__UpperCamelCase				)				)				)


if __name__ == "__main__":
      print(solution(int(input("Enter the Number: ").strip())))


