


"""simple docstring"""


from __future__ import annotations



def   snake_case						(				_a:     str		,   _a:     str							)->		bool:
      '''simple docstring'''


      lowerCamelCase__           =		get_failure_array(_a							)

      # 2) Step through text searching for pattern
      lowerCamelCase__    ,  lowerCamelCase__           =		0, 0  # index into text, pattern
      while i < len(_a							):
            if pattern[j] == text[i]:
                  if j == (len(_a							) - 1):
                        return True
                  j += 1

            # if this is a prefix in our pattern
            # just go back far enough to continue
            elif j > 0:
                  lowerCamelCase__           =		failure[j - 1]
                  continue
            i += 1
      return False



def   snake_case						(				_a:     str							)->		list[int]:
      '''simple docstring'''


      lowerCamelCase__           =		[0]
      lowerCamelCase__           =		0
      lowerCamelCase__           =		1
      while j < len(_a							):
            if pattern[i] == pattern[j]:
                  i += 1
            elif i > 0:
                  lowerCamelCase__           =		failure[i - 1]
                  continue
            j += 1
            failure.append(_a							)
      return failure


if __name__ == "__main__":
   # Test 1)
   _snake_case          =							"abc1abc12"
   _snake_case          =							"alskfjaldsabc1abc1abc12k23adsfabcabc"
   _snake_case          =							"alskfjaldsk23adsfabcabc"
   assert kmp(pattern, texta) and not kmp(pattern, texta)

   # Test 2)
   _snake_case          =							"ABABX"
   _snake_case          =							"ABABZABABYABABX"
   assert kmp(pattern, text)

   # Test 3)
   _snake_case          =							"AAAB"
   _snake_case          =							"ABAAAAAB"
   assert kmp(pattern, text)

   # Test 4)
   _snake_case          =							"abcdabcy"
   _snake_case          =							"abcxabcdabxabcdabcdabcy"
   assert kmp(pattern, text)

   # Test 5)
   _snake_case          =							"aabaabaaa"
   assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]







"""simple docstring"""


def   snake_case						(				_a:     int							)->		int:
      '''simple docstring'''


      lowerCamelCase__           =		1
      for i in range(1		,   num + 1							):
            fact *= i
      return fact



def   snake_case						(				_a:     int							)->		int:
      '''simple docstring'''


      lowerCamelCase__           =		0
      while number > 0:
            lowerCamelCase__           =		number % 10
            sum_of_digits += last_digit
            lowerCamelCase__           =		number // 10  # Removing the last_digit from the given number
      return sum_of_digits



def   snake_case						(				_a:     int = 100							)->		int:
      '''simple docstring'''


      lowerCamelCase__           =		factorial(_a							)
      lowerCamelCase__           =		split_and_add(_a							)
      return result


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



