

def 						_snake_case(    SCREAMING_SNAKE_CASE__			:	int = 1000      )							->      int:





    '''simple docstring'''






    A__          =   2**power
    A__          =   0
    while n:
        A__      ,						A__          =   r + n % 10, n // 10
    return r


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



"""simple docstring"""





from math import isqrt, loga



def 						_lowerCAmelCase				(				UpperCamelCase_				):
		__SCREAMING_SNAKE_CASE            = [True] * max_number
		for i in range(2  ,				isqrt(max_number - 1				) + 1				):
				if is_prime[i]:
						for j in range(i**2  ,				UpperCamelCase_  ,				UpperCamelCase_				):
								__SCREAMING_SNAKE_CASE            = False

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



def 						_lowerCAmelCase				(				UpperCamelCase_ = 80_0800  ,				UpperCamelCase_ = 80_0800				):
		__SCREAMING_SNAKE_CASE            = degree * loga(UpperCamelCase_				)
		__SCREAMING_SNAKE_CASE            = int(UpperCamelCase_				)
		__SCREAMING_SNAKE_CASE            = calculate_prime_numbers(UpperCamelCase_				)

		__SCREAMING_SNAKE_CASE            = 0
		__SCREAMING_SNAKE_CASE            = 0
		__SCREAMING_SNAKE_CASE            = len(UpperCamelCase_				) - 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() = }""")




