






"""simple docstring"""
def 							lowercase__		(				lowerCamelCase = 1_000					):
				_SCREAMING_SNAKE_CASE      :		List[Any]							=						[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)
				_SCREAMING_SNAKE_CASE      :		Union[str, Any]							=						[0, 0, 6, 6, 5, 5, 5, 7, 6, 6]

				_SCREAMING_SNAKE_CASE      :		Optional[int]							=						0

				for i in range(1,	n + 1					):
								if i < 1_000:
												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 // 1_000] + 8
				return count


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









"""simple docstring"""
def 							lowercase__		(				lowerCamelCase					):
				return -num if num < 0 else num





def 							lowercase__		(				lowerCamelCase					):
				if len(lowerCamelCase					) == 0:
								raise ValueError('abs_min() arg is an empty sequence'					)
				_SCREAMING_SNAKE_CASE      :		List[Any]							=						x[0]
				for i in x:
								if abs_val(lowerCamelCase					) < abs_val(lowerCamelCase					):
												_SCREAMING_SNAKE_CASE      :		List[Any]							=						i
				return j





def 							lowercase__		(				lowerCamelCase					):
				if len(lowerCamelCase					) == 0:
								raise ValueError('abs_max() arg is an empty sequence'					)
				_SCREAMING_SNAKE_CASE      :		Tuple							=						x[0]
				for i in x:
								if abs(lowerCamelCase					) > abs(lowerCamelCase					):
												_SCREAMING_SNAKE_CASE      :		Optional[Any]							=						i
				return j





def 							lowercase__		(				lowerCamelCase					):
				if len(lowerCamelCase					) == 0:
								raise ValueError('abs_max_sort() arg is an empty sequence'					)
				return sorted(lowerCamelCase,	key=lowerCamelCase					)[-1]





def 							lowercase__		(				):
				assert abs_val(0					) == 0
				assert abs_val(34					) == 34
				assert abs_val(-100_000_000_000					) == 100_000_000_000

				_SCREAMING_SNAKE_CASE      :		Tuple							=						[-3, -1, 2, -11]
				assert abs_max(lowerCamelCase					) == -11
				assert abs_max_sort(lowerCamelCase					) == -11
				assert abs_min(lowerCamelCase					) == -1


if __name__ == "__main__":
			import doctest

			doctest.testmod()

			test_abs_val()
			print(abs_val(-34))  # --> 34

