Problem:
Score : 300 points

Problem 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?

Constraints

1 \leq N \leq 10^5

|S| = N

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the final number of slimes.

Sample Input 1

10
aabbbbaaca

Sample Output 1

5

Ultimately, these slimes will fuse into abaca.

Sample Input 2

5
aaaaa

Sample Output 2

1

All the slimes will fuse into one.

Sample Input 3

20
xxzaffeeeeddfkkkkllq

Sample Output 3

10

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

N = gets.to_i
S = gets

slimes = S.chars

i = 1
cnt = 1

tmp = slimes.length

tmp.times do
  is_next_check = slimes[i].eql?(slimes[i+1])
  break if !is_next_check
  i += 1
end


slimes.length.times do
  break if i == slimes.length - 1
  
  if slimes[i] == slimes[i+1]
    # nothing
  else
    cnt += 1
  end
  
  i += 1
end

p cnt