





"""simple docstring"""





def 			UpperCAmelCase__							(  SCREAMING_SNAKE_CASE     :						int			):







      '''simple docstring'''




      if n == 1 or not isinstance(_A							,						_A			):
            return 0
      elif n == 2:
            return 1
      else:
            lowerCAmelCase  						=       [0, 1]
            for i in range(2							,						n + 1			):
                  sequence.append(sequence[i - 1] + sequence[i - 2]			)

            return sequence[n]


def 			UpperCAmelCase__							(  SCREAMING_SNAKE_CASE     :						int			):







      '''simple docstring'''




      lowerCAmelCase  						=       0
      lowerCAmelCase  						=       2

      while digits < n:
            index += 1
            lowerCAmelCase  						=       len(str(fibonacci(_A			)			)			)

      return index


def 			UpperCAmelCase__							(  SCREAMING_SNAKE_CASE     :						int = 10_00			):







      '''simple docstring'''




      return fibonacci_digits_index(_A			)


if __name__ == "__main__":
       print(solution(int(str(input()).strip())))









from math import factorial




def 			UpperCAmelCase__				(			_A      : int = 1_00							):





  '''simple docstring'''







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


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