Contest Duration: - (local time) (100 minutes) Back to Home
C - Slimes /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

N 匹のスライムが横一列に並んでいます。これらの色に関する情報が、長さ N の英小文字から成る文字列 S で与えられます。左から i 番目のスライムは、 Si 文字目に対応する色を持っています。

• 1 ≤ N ≤ 10^5
• |S| = N
• S は英小文字から成る

### 入力

N
S


### 入力例 1

10
aabbbbaaca


### 出力例 1

5


### 入力例 2

5
aaaaa


### 出力例 2

1


### 入力例 3

20
xxzaffeeeeddfkkkkllq


### 出力例 3

10


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