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 = str(input())
  s2 = str(input())
  diff = []
  for i in range(0, len(s1) - len(s2) + 1):
      str1 = s1[i : i + len(s2)]
      # print(str1)
      val = 0
      for i in range(len(str1)):
          if abs(ord(str1[i]) - ord(s2[i])) > 0:
              val += 1
      diff.append(val)
  print(min(diff))
  
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"}]