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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.*;

public class Main{
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        //int N = sc.nextInt();
        String S = sc.next();
        
        // リストを作る
        List<String> list = new ArrayList<String>();
        
        // 変数strの長さ分回す
        for (int i = 0; i < S.length(); i++) {
            // Sの先頭から1文字ずつString型にして取り出す
            String str = String.valueOf(S.charAt(i));
            // リストに順番に格納する
            list.add(str);
        }
        
        // 配列を回しながら隣と同じだったら消す
        for (int i = 0; i < list.size(); i++) {
            
            if(list.get(i).equals(list.get(i+1))){
                list.remove(list.get(i));
            }
        }      

        System.out.println(list.size());

        
    }
}