


"""simple docstring"""
from __future__ import annotations

__SCREAMING_SNAKE_CASE				:     Union[str, Any]		=     '''Alexander Joslin'''







def     _a					(   _SCREAMING_SNAKE_CASE					)     ->					int:

							if number <= 0:
														snake_case_     							=		f"""n must be greater than 0. Got n = {number}"""
														raise ValueError(_lowercase					)

							snake_case_     							=		[number + 1] * (number + 1)

							# starting position
							snake_case_     							=		0
							for i in range(1					,			_lowercase					):
														snake_case_     							=		min(table[i + 1]					,			table[i] + 1					)
														# check if out of bounds
														if i * 2 <= number:
																					snake_case_     							=		min(table[i * 2]					,			table[i] + 1					)
														# check if out of bounds
														if i * 3 <= number:
																					snake_case_     							=		min(table[i * 3]					,			table[i] + 1					)
							return table[number]


if __name__ == "__main__":
				import doctest

				doctest.testmod()








'''simple docstring'''

def     __UpperCamelCase					(				_lowercase = 1000       )			->      int:
	_lowercase       :							Optional[int]  	=		[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)
	_lowercase       :							List[Any]  	=		[0, 0, 6, 6, 5, 5, 5, 7, 6, 6]

	_lowercase       :							Any  	=		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())))
