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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

import Data.List
import Data.Char
import Data.Maybe
import Control.Monad
import qualified Data.Text as T
import qualified Data.Text.IO as T
import qualified Data.ByteString.Char8 as BS8

cntfw :: T.Text -> Int
cntfw s
    | T.length s <= 1 = 1
    | hs /= ss      = 1
    | otherwise     = 1 + (cntfw $ T.tail s)
    where
        hs = T.head s
        ss = T.head $ T.tail s

sol :: T.Text -> Int
sol s
    | T.length s <= 0 = 0
    | otherwise = 1 + (sol ds)
    where
        cnt = cntfw s
        ds  = T.drop cnt s

main :: IO ()
main = do
    n <- fst . fromJust . BS8.readInt <$> BS8.getLine
    s <- T.getLine

    print $ sol s