Problem:
Score : 300 points

Problem Statement

There are N stones arranged in a row. Every stone is painted white or black.
A string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.

Takahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.
Find the minimum number of stones that needs to be recolored.

Constraints

1 \leq N \leq 2\times 10^5

S is a string of length N consisting of . and #.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the minimum number of stones that needs to be recolored.

Sample Input 1

3
#.#

Sample Output 1

1

It is enough to change the color of the first stone to white.

Sample Input 2

5
#.##.

Sample Output 2

2

Sample Input 3

9
.........

Sample Output 3

0

Solution in C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

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



class Program
{
    const int MOD = 1000000007;
    const int INF = 1 << 30;

    static void Main(string[] args)
    {
        Solve();
    }



    static void Solve()
    {
        Scan sc = new Scan();
        write wr = new write();


        var N = sc.intarr[0];
        var S = sc.str;
        int kuro = 0;
        int shiro = 0;
        for (int i = 0; i < N; ++i)
        {
            if (S[i] == '#') kuro++;
        }
        int j = 0;
        while (S[j] == '.')
        {
            j++;
            shiro++;
        }

        if (S[N - 1] == '#')
        {
            if (S[0] == '.')
            {
                wr.wri(Math.Min(N - kuro - 1, kuro - shiro));

            }
            else
            {
                wr.wri(Math.Min(N - kuro, kuro - 1));

            }
        }
        else if (S[0] == '.')
        {
            wr.wri(Math.Min(kuro, N - kuro-shiro));
        }
        else
        {
            wr.wri(Math.Min(kuro, N - kuro ));

        }




    }
}





class Scan
{
    public string str => Console.ReadLine();

    public string[] strarr => str.Split(' ');

    public long[] longarr => strarr.Select(long.Parse).ToArray();
    public int[] intarr => strarr.Select(int.Parse).ToArray();
    public char[] chararr => str.ToArray();


}



class write
{
    public void wri<Type>(Type x)
    {
        Console.WriteLine(x);
    }
}