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: Accepted)

n = gets.chomp.to_i
s = gets.chomp.split('')
if n == 1
    puts 1
    exit
elsif n == 2
    puts s[0] == s[1] ? 1 : 2
    exit
end

comp = false
ans = s.length
i = 0
while true do
    if s[i+1] == s[i]
        s.delete_at(i+1)
    else
        i += 1
    end
    break if s.length == i+2
end
puts s[i] == s[i+1] ? s.length-1 : s.length