output_description: Print the final number of slimes.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      S
attempt: def solve(s: str) -> int:
      ret = 0
      cur_c = None
      for c in s:
          if c != cur_c:
              ret += 1
              cur_c = c
      return ret
  
  
  n = int(input().strip())
  s = input().strip()
  
  print(solve(s))
  
problem_description: Statement
  
  There are N slimes lining up from left to right. The colors of these slimes
  will be given as a string S of length N consisting of lowercase English
  letters. The i-th slime from the left has the color that corresponds to the
  i-th character of S.
  
  Adjacent slimes with the same color will fuse into one larger slime without
  changing the color. If there were a slime adjacent to this group of slimes
  before fusion, that slime is now adjacent to the new larger slime.
  
  Ultimately, how many slimes will be there?
samples: [{"input": "10\n    aabbbbaaca", "output": "5\n    \n\nUltimately, these slimes will fuse into `abaca`.\n\n* * *"}, {"input": "5\n    aaaaa", "output": "1\n    \n\nAll the slimes will fuse into one.\n\n* * *"}, {"input": "20\n    xxzaffeeeeddfkkkkllq", "output": "10"}]