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()
  subS = input()
  max_common = 0
  for idx in range(len(S)):
      curr_idx = idx
      sub_idx = 0
      curr_max = 0
      while sub_idx < len(subS) and curr_idx < len(S):
          if subS[sub_idx] == S[curr_idx]:
              curr_max += 1
          sub_idx += 1
          curr_idx += 1
      if curr_max > max_common:
          max_common = curr_max
  print(len(subS) - max_common)
  
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"}]