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: S = input()
  t = input()
  neq = len(t)
  for i in range(len(S) - len(t) + 1):
      if S[i] == t[0]:
          neq_temp = 0
          for j in range(1, len(t)):
              if S[i + j] != t[j]:
                  neq += 1
          neq = min(neq, neq_temp)
  print(neq)
  
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"}]