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 Rust (1.15.1) (judge verdict: Accepted)

fn slimes() -> Result<u32, &'static str> {
    let mut input = String::new();
    std::io::stdin().read_line(&mut input)
        .map_err(|_| "input error")?;
    let n = input.trim_right().parse::<usize>()
        .map_err(|_| "parse error")?;

    let mut line = String::new();
    std::io::stdin().read_line(&mut line)
        .map_err(|_| "input error")?;

    let mut chars = line.chars();
    let mut recur = chars.nth(0).ok_or("0 nth error")?;
    let mut count = 0u32;

    for c in chars {
        if recur != c {
            count = count + 1;
            recur = c;
        }
    }
    return Ok(count);
}

fn main() {
    println!("{}", slimes().unwrap());
}