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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
int main()
{
   int t,i,count=0;
   char s[100000],b[100000];
   scanf("%d", &t);
   for(i=0;i<=t;i++)
   {
       scanf("%c", &s[i]);
   }
   for(i=0;i<t-1;i++)
   {
       if(s[i]!=s[i+1])
       {
          ++count;
       }
   }
   if(t==1)
   {
       count++;
   }
  if(count>1)
  {
      count++;
  }
  if(t==2)
  {
      if(s[0]!=s[1])
      {
          count=2;
      }
  }

       printf("%d\n", count);


     return 0;
 }