


"""simple docstring"""






import math



def 			A__		(					_UpperCAmelCase    :      int	)							->	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(_UpperCAmelCase	) + 1	)				,    6	):
		if number % i == 0 or number % (i + 2) == 0:
			return False
	return True



def 			A__		(					_UpperCAmelCase    :      int = 60_08_51_47_51_43	)							->	int:

	'''simple docstring'''


	try:
		snake_case__  :						List[Any]		=      int(_UpperCAmelCase	)
	except (TypeError, ValueError):
		raise TypeError("Parameter n must be int or castable to int."	)
	if n <= 0:
		raise ValueError("Parameter n must be greater than or equal to one."	)
	snake_case__  :						int		=      0
	if is_prime(_UpperCAmelCase	):
		return n
	while n % 2 == 0:
		n //= 2
	if is_prime(_UpperCAmelCase	):
		return n
	for i in range(3				,    int(math.sqrt(_UpperCAmelCase	)	) + 1				,    2	):
		if n % i == 0:
			if is_prime(n // i	):
				snake_case__  :						int		=      n // i
				break
			elif is_prime(_UpperCAmelCase	):
				snake_case__  :						List[Any]		=      i
	return max_number


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









def 			__lowerCAmelCase       (SCREAMING_SNAKE_CASE = 1000   )->    int:




      """simple docstring"""

      snake_case_			= [0, 3, 3, 5, 4, 4, 3, 5, 5, 4, 3, 6, 6, 8, 8, 7, 7, 9, 8, 8]
      # number of letters in twenty, thirty, ..., ninety (0 for numbers less than
      # 20 due to inconsistency in teens)
      snake_case_			= [0, 0, 6, 6, 5, 5, 5, 7, 6, 6]

      snake_case_			= 0

      for i in range(1   ,   n + 1   ):
            if i < 1000:
                  if i >= 100:
                        # add number of letters for "n hundred"
                        count += ones_counts[i // 100] + 7

                        if i % 100 != 0:
                              # add number of letters for "and" if number is not multiple
                              # of 100
                              count += 3

                  if 0 < i % 100 < 20:
                        # add number of letters for one, two, three, ..., nineteen
                        # (could be combined with below if not for inconsistency in
                        # teens)
                        count += ones_counts[i % 100]
                  else:
                        # add number of letters for twenty, twenty one, ..., ninety
                        # nine
                        count += ones_counts[i % 10]
                        count += tens_counts[(i % 100 - i % 10) // 10]
            else:
                  count += ones_counts[i // 1000] + 8
      return count


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