output_description: Print the minimum number of characters in S that need to be changed.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
      T
attempt: s1 = input()
  s2 = input()
  list_s1 = list(s1)
  list_s2 = list(s2)
  len_s1 = len(s1)
  len_s2 = len(s2)
  change_count_min = len_s2
  for i in range(len_s1 - len_s2 + 1):
      change_count = len_s2
      for j in range(len_s2):
          if list_s1[j + i] == list_s2[j]:
              change_count -= 1
      if change_count < change_count_min:
          change_count_min = change_count
  print(change_count_min)
  
problem_description: Statement
  
  Given are two strings S and T.
  
  Let us change some of the characters in S so that T will be a substring of S.
  
  At least how many characters do we need to change?
  
  Here, a substring is a consecutive subsequence. For example, `xxx` is a
  substring of `yxxxy`, but not a substring of `xxyxx`.
samples: [{"input": "cabacc\n    abc", "output": "1\n    \n\nFor example, changing the fourth character `a` in S to `c` will match the\nsecond through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one\n- is the minimum needed.\n\n* * *"}, {"input": "codeforces\n    atcoder", "output": "6"}]