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 JavaScript (node.js v5.12) (judge verdict: Accepted)

function Main(input) {
  var lines = input.split('\n');
  var N = Number(lines[0]);
  var S = lines[1];
  var count = 0;
  var before = '';
  for (var i = 0; i < N; i ++) {
    var current = S.charAt(i);
    if (before !== current) {
      count++;
    }
    before = current;
  }
  console.log(count);
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));