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# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Atc_0040
{
    class Program
    {
        static void Main(string[] args)
        {
            var St = Console.ReadLine();

            long N = long.Parse(St);

            var S = Console.ReadLine().ToArray<char>();

            if (S.Length == 1)
            {
                Console.WriteLine(1);
                return;
            }

            string va = "";

            for (long i = 0; i < N - 1; i++)
            {
                if (S[i] == S[i + 1])
                {
                    continue;
                }
                va += S[i];
            }

            if (S[N - 2] != S[N - 1])
            {
                va += S[N - 1];
            }

            if (va.Length == 0)
            {
                va += S[0];
            }

            Console.WriteLine(va.Length);

        }
    }
}