
from math import isqrt, loga




def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     int)   ->       list[int]:






							'''simple docstring'''





							__UpperCamelCase      :  List[str]       =   [True] * max_number
							for i in range(2		,    isqrt(max_number - 1) + 1):
														if is_prime[i]:
																					for j in range(i**2		,    _lowerCamelCase		,    _lowerCamelCase):
																												__UpperCamelCase      :  str       =   False

							return [i for i in range(2		,    _lowerCamelCase) if is_prime[i]]




def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     int = 800_800		,    _lowerCamelCase					:     int = 800_800)   ->       int:






							'''simple docstring'''





							__UpperCamelCase      :  int       =   degree * loga(_lowerCamelCase)
							__UpperCamelCase      :  Optional[int]       =   int(_lowerCamelCase)
							__UpperCamelCase      :  Optional[int]       =   calculate_prime_numbers(_lowerCamelCase)

							__UpperCamelCase      :  str       =   0
							__UpperCamelCase      :  int       =   0
							__UpperCamelCase      :  Any       =   len(_lowerCamelCase) - 1
							while left < right:
														while (
														    prime_numbers[right] * loga(prime_numbers[left])
														    + prime_numbers[left] * loga(prime_numbers[right])
														    > upper_bound
														):
																					right -= 1
														hybrid_integers_count += right - left
														left += 1

							return hybrid_integers_count


if __name__ == "__main__":
		print(f"{solution() = }")

def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     int)   ->       int:






							'''simple docstring'''





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




def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     int)   ->       int:






							'''simple docstring'''





							__UpperCamelCase      :  Dict       =   0
							while number > 0:
														__UpperCamelCase      :  List[Any]       =   number % 10
														sum_of_digits += last_digit
														__UpperCamelCase      :  List[Any]       =   number // 10  # Removing the last_digit from the given number
							return sum_of_digits




def       _SCREAMING_SNAKE_CASE   (						_lowerCamelCase					:     int = 100)   ->       int:






							'''simple docstring'''





							__UpperCamelCase      :  Optional[Any]       =   factorial(_lowerCamelCase)
							__UpperCamelCase      :  Tuple       =   split_and_add(_lowerCamelCase)
							return result


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