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 Python (3.4.3) (judge verdict: Accepted)

# coding: utf-8
# Your code here!
 
#in_N = [int(i) for i in input().split()];
in_N = int(input());
in_S = str(input());
#in_S = [str(i) for i in input().split()];
S = [str(s) for s in in_S]
#print(in_N);
#print(in_S);
#print(S);

#calc
total = 0;
for i in range(in_N-1):
    if(S[i] == S[i+1]):
        total +=1;
#    for j in range(len(in_d)-1):
        #print(i);
        #print(j);
#        if(i+j+1 == len(in_d)):break;
#        total += in_d[i]*in_d[i+j+1];
 
print(in_N - total);