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 num = 0;//合計スライム
  var i = 0;//文字列カウンタ
  var inputN;
  var inputD;
  input = input.split('\n');
  inputN = parseInt(input[0]);
  inputD =  input[1];

  while(i<inputN){
    if(inputD.charAt(i) == inputD.charAt(i+1)){
      i++;
      continue;
    }
    i++;
    num++;
  }
  console.log(num);
}

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