

class 							A_			:


     def __init__(							self      :		Dict )							->     None:
      __lowerCAmelCase:       Union[str, Any]            =				[0, 1]


     def   UpperCAmelCase  (							self      :		List[Any]      ,  UpperCAmelCase      :		int )							->     list:
      if (difference := index - (len(self.sequence ) - 2)) >= 1:
       for _ in range(UpperCAmelCase ):
        self.sequence.append(self.sequence[-1] + self.sequence[-2] )
      return self.sequence[:index]







def _a			(	)   ->   None:

 """simple docstring"""






 print(
     'Fibonacci Series Using Dynamic Programming\n'   , 'Enter the index of the Fibonacci number you want to calculate '   , 'in the prompt below. (To exit enter exit or Ctrl-C)\n'   , sep=''   , )
 __lowerCAmelCase:       Optional[int]            =				Fibonacci()

 while True:
  __lowerCAmelCase:       str            =				input('>> '		)
  if prompt in {"exit", "quit"}:
   break

  try:
   __lowerCAmelCase:       int            =				int(SCREAMING_SNAKE_CASE		)
  except ValueError:
   print('Enter a number or \'exit\''		)
   continue

  print(fibonacci.get(SCREAMING_SNAKE_CASE		)		)


if __name__ == "__main__":
  main()








def _a			(	SCREAMING_SNAKE_CASE		:      int = 10_00		)   ->   int:

 """simple docstring"""






 __lowerCAmelCase:       Union[str, 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)
 __lowerCAmelCase:       Union[str, Any]            =				[0, 0, 6, 6, 5, 5, 5, 7, 6, 6]

 __lowerCAmelCase:       Optional[int]            =				0

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

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

   if 0 < i % 1_00 < 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 % 1_00]
   else:
    # add number of letters for twenty, twenty one, ..., ninety
    # nine
    count += ones_counts[i % 10]
    count += tens_counts[(i % 1_00 - i % 10) // 10]
  else:
   count += ones_counts[i // 10_00] + 8
 return count


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





