

"""simple docstring"""





from math import factorial




def   _A  (  UpperCamelCase_     :       int = 100)	->						int:
   '''simple docstring'''


   return sum(int(UpperCamelCase_) for x in str(factorial(UpperCamelCase_)))


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







"""simple docstring"""





from __future__ import annotations

from typing import Any




class 					_lowerCAmelCase  :







 """simple docstring"""







 def __init__(			self							:			Any,					UpperCAmelCase__							:			int	):
    __lowercase								=						num_of_nodes
    __lowercase								=						[]
    __lowercase								=						{}


 def 					_lowercase (			self							:			Optional[Any],					UpperCAmelCase__							:			int,					UpperCAmelCase__							:			int,					UpperCAmelCase__							:			int	):
    self.m_edges.append([u_node, v_node, weight]	)


 def 					_lowercase (			self							:			Union[str, Any],					UpperCAmelCase__							:			int	):

    if self.m_component[u_node] == u_node:
       return u_node
    return self.find_component(self.m_component[u_node]	)


 def 					_lowercase (			self							:			List[Any],					UpperCAmelCase__							:			int	):

    if self.m_component[u_node] != u_node:
       for k in self.m_component:
          __lowercase								=						self.find_component(UpperCAmelCase__	)


 def 					_lowercase (			self							:			Union[str, Any],					UpperCAmelCase__							:			list[int],					UpperCAmelCase__							:			int,					UpperCAmelCase__							:			int	):

    if component_size[u_node] <= component_size[v_node]:
       __lowercase								=						v_node
       component_size[v_node] += component_size[u_node]
       self.set_component(UpperCAmelCase__	)

    elif component_size[u_node] >= component_size[v_node]:
       __lowercase								=						self.find_component(UpperCAmelCase__	)
       component_size[u_node] += component_size[v_node]
       self.set_component(UpperCAmelCase__	)



 def 					_lowercase (			self							:			Any	):
    __lowercase								=						[]
    __lowercase								=						0

    __lowercase								=						[-1] * self.m_num_of_nodes

    # A list of components (initialized to all of the nodes)
    for node in range(self.m_num_of_nodes	):
       self.m_component.update({node: node}	)
       component_size.append(1	)

    __lowercase								=						self.m_num_of_nodes

    while num_of_components > 1:
       for edge in self.m_edges:
          __lowercase		,__lowercase		,__lowercase								=						edge

          __lowercase								=						self.m_component[u]
          __lowercase								=						self.m_component[v]

          if u_component != v_component:

             for component in (u_component, v_component):
                if (
                    minimum_weight_edge[component] == -1
                    or minimum_weight_edge[component][2] > w
                ):
                   __lowercase								=						[u, v, w]

       for edge in minimum_weight_edge:
          if isinstance(UpperCAmelCase__,					UpperCAmelCase__	):
             __lowercase		,__lowercase		,__lowercase								=						edge

             __lowercase								=						self.m_component[u]
             __lowercase								=						self.m_component[v]

             if u_component != v_component:
                mst_weight += w
                self.union(UpperCAmelCase__,					UpperCAmelCase__,					UpperCAmelCase__	)
                print(F"""Added edge [{u} - {v}]\nAdded weight: {w}\n"""	)
                num_of_components -= 1

       __lowercase								=						[-1] * self.m_num_of_nodes
    print(F"""The total weight of the minimal spanning tree is: {mst_weight}"""	)







def   _A  (  )	->						None:
   '''simple docstring'''




if __name__ == "__main__":
   import doctest

   doctest.testmod()




