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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;

public class Main {
	public static void main(String[]args) {
		try(Scanner scan = new Scanner(System.in)){
			
			int N = scan.nextInt();
			String S = scan.next();
			
		
			StringBuffer sc = new StringBuffer();
		
			
			if(N==1) {
				System.out.println(1);
			}else {
				sc.append(S.substring(0,1));
				
				for(int i = 1;i<=N-1;i++) {
					String s1 = S.substring(i-1, i);
				    String s2 = S.substring(i, i+1);
				    
				    if(s1.equals(s2)) {
				    	sc.append("X");
				    }else{
				    	sc.append(s2);
				    }
				}
				
				
				int count = 0;
				
				
				for(int i = 0;i<N;i++) {
					String s5 = sc.toString().substring(i, i+1);
					
					if(!s5.equals("X")) {
						count++;
					}
					
				}
				 
				System.out.println(count);
				
			
			
			}
			
			
			
			
			
			
			
			
		}
		
		
	}
		

}