


'''simple docstring'''
def      __snake_case       (       lowerCamelCase_ :				int = 1000						):
				'''simple docstring'''




				__magic_name__	  = [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)
				__magic_name__	  = [0, 0, 6, 6, 5, 5, 5, 7, 6, 6]

				__magic_name__	  = 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())))







'''simple docstring'''
from __future__ import annotations




def      __snake_case       (       lowerCamelCase_ :				list[list[int]]	,  lowerCamelCase_ :				list[list[int]]						):
				'''simple docstring'''




				assert len(lowerCamelCase_						) == len(lowerCamelCase_						)

				__magic_name__	  = len(lowerCamelCase_						)
				__magic_name__	  = list(range(lowerCamelCase_						)						)
				__magic_name__	  = [-1] * n  # who the donor has donated to
				__magic_name__	  = [-1] * n  # who the recipient has received from
				__magic_name__	  = [0] * n

				while unmatched_donors:
								__magic_name__	  = unmatched_donors[0]
								__magic_name__	  = donor_pref[donor]
								__magic_name__	  = donor_preference[num_donations[donor]]
								num_donations[donor] += 1
								__magic_name__	  = recipient_pref[recipient]
								__magic_name__	  = rec_record[recipient]

								if prev_donor != -1:
												if rec_preference.index(lowerCamelCase_						) > rec_preference.index(lowerCamelCase_						):
																__magic_name__	  = donor
																__magic_name__	  = recipient
																unmatched_donors.append(lowerCamelCase_						)
																unmatched_donors.remove(lowerCamelCase_						)
								else:
												__magic_name__	  = donor
												__magic_name__	  = recipient
												unmatched_donors.remove(lowerCamelCase_						)
				return donor_record



