





def 				__UpperCamelCase  (		snake_case = 1_0_0_0     )  ->						int:


   '''simple docstring'''







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

   __A				 =       0

   for i in range(1    ,	n + 1     ):
      if i < 1_0_0_0:
         if i >= 1_0_0:
            # add number of letters for "n hundred"
            count += ones_counts[i // 1_0_0] + 7

            if i % 1_0_0 != 0:
               # add number of letters for "and" if number is not multiple
               # of 100
               count += 3

         if 0 < i % 1_0_0 < 2_0:
            # add number of letters for one, two, three, ..., nineteen
            # (could be combined with below if not for inconsistency in
            # teens)
            count += ones_counts[i % 1_0_0]
         else:
            # add number of letters for twenty, twenty one, ..., ninety
            # nine
            count += ones_counts[i % 1_0]
            count += tens_counts[(i % 1_0_0 - i % 1_0) // 1_0]
      else:
         count += ones_counts[i // 1_0_0_0] + 8
   return count


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








from __future__ import annotations

import sys
def 				__UpperCamelCase  (		snake_case    ,	snake_case     )  ->						tuple[int, int]:


   '''simple docstring'''







   if abs(snake_case     ) == 1:
      return a, 0
   elif abs(snake_case     ) == 1:
      return 0, b

   __A ,						__A				 =       a, b
   __A ,						__A				 =       1, 0
   __A ,						__A				 =       0, 1

   while remainder != 0:
      __A				 =       old_remainder // remainder
      __A ,						__A				 =       remainder, old_remainder - quotient * remainder
      __A ,						__A				 =       coeff_a, old_coeff_a - quotient * coeff_a
      __A ,						__A				 =       coeff_b, old_coeff_b - quotient * coeff_b

   # sign correction for negative numbers
   if a < 0:
      __A				 =       -old_coeff_a
   if b < 0:
      __A				 =       -old_coeff_b

   return old_coeff_a, old_coeff_b
def 				__UpperCamelCase  (		)  ->						Tuple:


   '''simple docstring'''







   if len(sys.argv     ) < 3:
      print('''2 integer arguments required'''     )
      return 1
   __A				 =       int(sys.argv[1]     )
   __A				 =       int(sys.argv[2]     )
   print(extended_euclidean_algorithm(snake_case    ,	snake_case     )     )
   return 0


if __name__ == "__main__":
    raise SystemExit(main())

