code: 
  
  
  """simple docstring"""
  
  
  
  
  def 			a_   (  lowercase__   :int = 1000    ):
  			__lowerCamelCase        =			[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        =			[0, 0, 6, 6, 5, 5, 5, 7, 6, 6]
  
  			__lowerCamelCase        =			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())))
  
  
  
  
  
style_context: 
  
  
  """simple docstring"""
  
  
  
  
  from __future__ import annotations
  
  import re
  
  
  
  
  
  def 			a_   (  lowercase__   :list[str]    ):
  
  			def alphanum_key(lowercase__   :int    ):
  						return [int(lowercase__    ) if s.isdigit() else s.lower() for s in re.split("""([0-9]+)""", lowercase__    )]
  
  			return sorted(lowercase__, key=lowercase__    )
  
  
  if __name__ == "__main__":
  					import doctest
  
  					doctest.testmod()
  
  
  
  
  