





from math import factorial


def       UpperCamelCase__(			UpperCamelCase__     :			int = 1_00    )->int:
       return sum(map(UpperCamelCase__					,	str(factorial(UpperCamelCase__    )    )    )    )


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












class        SCREAMING_SNAKE_CASE__					:



 def __init__(				self,__lowerCamelCase					):
        A__		   =		size
        A__		   =		[0] * size
        A__		   =		[0] * size



 @staticmethod
 def 							UpperCamelCase     (				__lowerCamelCase					):
        return index | (index + 1)



 @staticmethod
 def 							UpperCamelCase     (				__lowerCamelCase					):
        return (index & (index + 1)) - 1



 def 							UpperCamelCase     (				self,__lowerCamelCase,__lowerCamelCase					):
        A__		   =		value
        while index < self.size:
               A__		   =		self.get_prev(__lowerCamelCase					) + 1
               if current_left_border == index:
                      A__		   =		value
               else:
                      A__		   =		max(__lowerCamelCase,__lowerCamelCase,__lowerCamelCase					)
               A__		   =		self.get_next(__lowerCamelCase					)




 def 							UpperCamelCase     (				self,__lowerCamelCase,__lowerCamelCase					):
        right -= 1  # Because of right is exclusive
        A__		   =		0
        while left <= right:
               A__		   =		self.get_prev(__lowerCamelCase					)
               if left <= current_left:
                      A__		   =		max(__lowerCamelCase,self.tree[right]					)
                      A__		   =		current_left
               else:
                      A__		   =		max(__lowerCamelCase,self.arr[right]					)
                      right -= 1
        return result


if __name__ == "__main__":
       import doctest

       doctest.testmod()





