


def 			__SCREAMING_SNAKE_CASE		(		UpperCamelCase		:      List[str]     ,					UpperCamelCase		:      Optional[int]	)     ->	int:



	"""simple docstring"""






	a_     			=   sorted(SCREAMING_SNAKE_CASE_     ,					key=lambda UpperCamelCase	: value[2]     ,					reverse=SCREAMING_SNAKE_CASE_	)

	# Create a list of size equal to the maximum deadline
	# and initialize it with -1
	a_     			=   max(SCREAMING_SNAKE_CASE_     ,					key=lambda UpperCamelCase	: value[1]	)[1]
	a_     			=   [-1] * max_deadline

	# Finding the maximum profit and the count of jobs
	a_     			=   0
	a_     			=   0
	for job in jobs:
		# Find a free time slot for this job
		# (Note that we start from the last possible slot)
		for i in range(job[1] - 1     ,					-1     ,					-1	):
			if time_slots[i] == -1:
				a_     			=   job[0]
				count += 1
				max_profit += job[2]
				break
	return [count, max_profit]


if __name__ == "__main__":
			import doctest

			doctest.testmod()
'''simple docstring'''




def _UpperCamelCase (							SCREAMING_SNAKE_CASE_ = 1_000				):
     lowercase_       :							Tuple  					=       [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_       :							Optional[Any]  					=       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())))




