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: Accepted)

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

namespace AtCoder
{
    class Program
    {
        static long ReadLong()
        {
            return long.Parse(Console.ReadLine());
        }

        static long[] ReadLongs()
        {
            return Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
        }

        static double ReadDouble()
        {
            return double.Parse(Console.ReadLine());
        }

        static double[] ReadDoubles()
        {
            return Console.ReadLine().Split(' ').Select(double.Parse).ToArray();
        }

        static string ReadString()
        {
            return Console.ReadLine();
        }

        static string[] ReadStringSplit()
        {
            return Console.ReadLine().Split(' ');
        }

        static void A()
        {
            var AB = ReadLongs();
            var A = AB[0];
            var B = AB[1];
            Console.WriteLine(Math.Max(A - (2 * B), 0));
        }

        static void B()
        {
            var N = ReadLong();
            var ds = ReadLongs();
            long ans = 0;
            foreach (var x in Enumerable.Range(0, (int)N))
            {
                foreach (var y in Enumerable.Range(x, (int)N - x))
                {
                    if (x == y)
                    {
                        continue;
                    }
                    ans += ds[x] * ds[y];
                }
            }
            Console.WriteLine(ans);
        }

        static void C()
        {
            var N = ReadLong();
            var S = ReadString();
            char prev = '0';
            long ans = 0;
            foreach (var x in S)
            {
                if (x == prev)
                {
                    continue;
                }

                prev = x;
                ans++;
            }
            Console.WriteLine(ans);
        }

        static void D()
        {

        }

        static void Main(string[] args)
        {
            //A();
            //B();
            C();
            //D();
        }
    }
}