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 C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main (void) {
    int n;
    scanf("%d", &n);

    char s[n+2];
    s[0] = '1';
    scanf("%s", &s[1]);

    int i;
    int merged_idx=0;
    char s_merged[n+2];
    memset(s_merged, '\0', sizeof(char)*(n+2));
    s_merged[0] = s[0];

    for ( i=1; i<=n; i++ ) {
        if ( s[i] != s_merged[merged_idx] ) {
            merged_idx++;
            s_merged[merged_idx] = s[i];
        }
    }
    s_merged[merged_idx+1] = '\0';

    int ans = strlen(&s_merged[1]);

    printf("%d\n", ans);
    return EXIT_SUCCESS;
}