




import math







def SCREAMING_SNAKE_CASE       ( lowercase_		)     -> bool:



       """simple docstring"""

       if 1 < number < 4:
              # 2 and 3 are primes
              return True
       elif number < 2 or number % 2 == 0 or number % 3 == 0:
              # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
              return False

       # All primes number are in format of 6k +/- 1
       for i in range(5				,       int(math.sqrt(lowercase_		) + 1		)				,       6		):
              if number % i == 0 or number % (i + 2) == 0:
                     return False
       return True







def SCREAMING_SNAKE_CASE       ( lowercase_ = 0.1		)     -> int:



       """simple docstring"""

       A__   				=					3
       A__   				=					3

       while primes / (2 * j - 1) >= ratio:
              for i in range(j * j + j + 1				,       (j + 2) * (j + 2)				,       j + 1		):
                     primes += is_prime(lowercase_		)
              j += 2
       return j


if __name__ == "__main__":
  import doctest

  doctest.testmod()








def SCREAMING_SNAKE_CASE       ( lowercase_		)     -> int:



       """simple docstring"""

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







def SCREAMING_SNAKE_CASE       ( lowercase_		)     -> int:



       """simple docstring"""

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







def SCREAMING_SNAKE_CASE       ( lowercase_ = 100		)     -> int:



       """simple docstring"""

       A__   				=					factorial(lowercase_		)
       A__   				=					split_and_add(lowercase_		)
       return result


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


