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)

gets
puts gets.chomp
  .gsub(/a+/, 'a')
  .gsub(/b+/, 'b')
  .gsub(/c+/, 'c')
  .gsub(/d+/, 'd')
  .gsub(/e+/, 'e')
  .gsub(/f+/, 'f')
  .gsub(/g+/, 'g')
  .gsub(/h+/, 'h')
  .gsub(/i+/, 'i')
  .gsub(/j+/, 'j')
  .gsub(/k+/, 'k')
  .gsub(/l+/, 'l')
  .gsub(/m+/, 'm')
  .gsub(/n+/, 'n')
  .gsub(/o+/, 'o')
  .gsub(/p+/, 'p')
  .gsub(/q+/, 'q')
  .gsub(/r+/, 'r')
  .gsub(/s+/, 's')
  .gsub(/t+/, 't')
  .gsub(/u+/, 'u')
  .gsub(/v+/, 'v')
  .gsub(/w+/, 'w')
  .gsub(/x+/, 'x')
  .gsub(/y+/, 'y')
  .gsub(/z+/, 'z')
  .length