def 						UpperCAmelCase							(		lowerCAmelCase_    ,   lowerCAmelCase_							)						->						int:

     if len(lowerCAmelCase_							) < len(lowerCAmelCase_							):
          return levenshtein_distance(lowerCAmelCase_    ,   lowerCAmelCase_							)

     if len(lowerCAmelCase_							) == 0:
          return len(lowerCAmelCase_							)

     a	:     Optional[int]						      =    list(range(len(lowerCAmelCase_							) + 1							)							)

     for i, ca in enumerate(lowerCAmelCase_							):
          a	:     Tuple						      =    [i + 1]

          for j, ca in enumerate(lowerCAmelCase_							):
               # Calculate insertions, deletions and substitutions
               a	:     List[str]						      =    previous_row[j + 1] + 1
               a	:     Optional[int]						      =    current_row[j] + 1
               a	:     Tuple						      =    previous_row[j] + (ca != ca)

               # Get the minimum to append to the current row
               current_row.append(min(lowerCAmelCase_    ,   lowerCAmelCase_    ,   lowerCAmelCase_							)							)

          # Store the previous row
          a	:     Dict						      =    current_row

     # Returns the last element (distance)
     return previous_row[-1]


if __name__ == "__main__":
  UpperCAmelCase				 =   input("""Enter the first word:\n""").strip()
  UpperCAmelCase				 =   input("""Enter the second word:\n""").strip()

  UpperCAmelCase				 =   levenshtein_distance(first_word, second_word)
  print(F'''Levenshtein distance between {first_word} and {second_word} is {result}''')



def 			__lowerCAmelCase       (SCREAMING_SNAKE_CASE = 1000   )->    int:




      """simple docstring"""

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

      snake_case_			= 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())))