






"""simple docstring"""







def 						lowercase__(A = 1_000						)				->int:




						"""simple docstring"""



						lowercase__				:      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)
						lowercase__				:      List[str]=       [0, 0, 6, 6, 5, 5, 5, 7, 6, 6]

						lowercase__				:      Dict=       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"""







from collections import Counter
from functools import total_ordering

from data_structures.heap.heap import Heap


@total_ordering
class     __UpperCAmelCase:




						"""simple docstring"""




						def __init__(   self       ,  snake_case__       ,  snake_case__			):
												'''simple docstring'''
												lowercase__				:      Optional[Any]=       word
												lowercase__				:      Any=       count




						def __eq__(   self       ,  snake_case__			):
												'''simple docstring'''
												if not isinstance(snake_case__       ,  snake_case__			):
																		return NotImplemented
												return self.count == other.count




						def __lt__(   self       ,  snake_case__			):
												'''simple docstring'''
												if not isinstance(snake_case__       ,  snake_case__			):
																		return NotImplemented
												return self.count < other.count





def 						lowercase__(A					,		A						)				->list[str]:




						"""simple docstring"""



						lowercase__				:      Heap[WordCount]=       Heap()
						lowercase__				:      str=       Counter(A						)
						heap.build_max_heap(
						    [WordCount(A					,		A						) for word, count in count_by_word.items()]						)
						return [heap.extract_max().word for _ in range(min(A					,		len(A						)						)						)]


if __name__ == "__main__":
			import doctest

			doctest.testmod()






