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 Scala (2.11.7) (judge verdict: Accepted)

object Main extends App {
  val sc = new java.util.Scanner(System.in)
  val slimeCount :Int = sc.nextInt()
  val slimes :String = sc.next()
  val slimeList :List[Char] = slimes.toCharArray.toList

  def go(count: Int)(slimes: List[Char]): Int = slimes match {
    case h::t if t.isEmpty => count
    case h::t if h == t.head => go(count)(t)
    case h::t => go(count + 1)(t)
  }

  println(go(1)(slimeList))
}