


'''simple docstring'''





from __future__ import annotations


def 					a__    (				UpperCamelCase_	:			list,      UpperCamelCase_	:			list	):
   UpperCAmelCase__  :Union[str, Any]            =			[None] * (len(a_	) + len(a_	))

   UpperCAmelCase__  :Any            =			0  # pointer to current index for left Half
   UpperCAmelCase__  :Union[str, Any]            =			0  # pointer to current index for the right Half
   UpperCAmelCase__  :Union[str, Any]            =			0  # pointer to current index for the sorted array Half

   while pointera < len(a_	) and pointera < len(a_	):
      if left_half[pointera] < right_half[pointera]:
         UpperCAmelCase__  :Dict            =			left_half[pointera]
         pointera += 1
         index += 1
      else:
         UpperCAmelCase__  :List[Any]            =			right_half[pointera]
         pointera += 1
         index += 1
   while pointera < len(a_	):
      UpperCAmelCase__  :int            =			left_half[pointera]
      pointera += 1
      index += 1

   while pointera < len(a_	):
      UpperCAmelCase__  :str            =			right_half[pointera]
      pointera += 1
      index += 1

   return sorted_array


def 					a__    (				UpperCamelCase_	:			list	):
   if len(a_	) <= 1:
      return array
   # the actual formula to calculate the middle element = left + (right - left) // 2
   # this avoids integer overflow in case of large N
   UpperCAmelCase__  :Tuple            =			0 + (len(a_	) - 0) // 2

   # Split the array into halves till the array length becomes equal to One
   # merge the arrays of single length returned by mergeSort function and
   # pass them into the merge arrays function which merges the array
   UpperCAmelCase__  :Dict            =			array[:middle]
   UpperCAmelCase__  :Union[str, Any]            =			array[middle:]

   return merge(merge_sort(a_	),      merge_sort(a_	)	)


if __name__ == "__main__":
    import doctest

    doctest.testmod()







'''simple docstring'''





def 					a__    (				UpperCamelCase_	:			int = 100	):
   UpperCAmelCase__  :List[str]            =			1
   UpperCAmelCase__  :Dict            =			0
   for i in range(1,      num + 1	):
      fact *= i

   for j in str(UpperCamelCase_	):
      result += int(UpperCamelCase_	)

   return result


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



