def      a__ (		__UpperCamelCase     ,      __UpperCamelCase				):
      SCREAMING_SNAKE_CASE_          =  len(__UpperCamelCase				)
      SCREAMING_SNAKE_CASE_          =  [[False] * (required_sum + 1) for _ in range(arr_len + 1				)]

      # for each arr value, a sum of zero(0) can be formed by not taking any element
      # hence True/1
      for i in range(arr_len + 1				):
            SCREAMING_SNAKE_CASE_          =  True

      # sum is not zero and set is empty then false
      for i in range(1     ,      required_sum + 1				):
            SCREAMING_SNAKE_CASE_          =  False

      for i in range(1     ,      arr_len + 1				):
            for j in range(1     ,      required_sum + 1				):
                  if arr[i - 1] > j:
                        SCREAMING_SNAKE_CASE_          =  subset[i - 1][j]
                  if arr[i - 1] <= j:
                        SCREAMING_SNAKE_CASE_          =  subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

      return subset[arr_len][required_sum]


if __name__ == "__main__":
      import doctest

      doctest.testmod()



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())))


