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: Wrong Answer)

using System;
using System.Linq;

namespace AtCoder.Tenka1_C2019.C
{
    class Program
    {
        static void Rep(long n, Action<long> action) { for (var i = 0; i < n; ++i) { action(i); } }
        static void Rep(long n, long s, Action<long> action) { for (var i = s; i < n; ++i) { action(i); } }
        public static void Main()
        {
            // NG: #.
            // #.# 1
            // ..#
            // #.##. 2
            // #.##. 2
            // #####
            // OK
            // ......#
            // .#######

            // Solve(3, "#.#"); // 1
            // Solve(5, "#.##."); // 2
            // Solve(9, "........."); // 0
            // Solve(5, "####."); // 1
            // Solve(5, "###.."); // 2
            // Solve(5, "#...#"); // 1
            // Solve(5, "#...."); // 1
            // Solve(5, ".###."); // 1
            // Solve(5, "####."); // 1
            // Solve(5, "#####"); // 0
            // Solve(5, ".####"); // 0
            // Solve(5, "#.###"); // 1
            // Solve(5, "..###"); // 1
            // Solve(5, "....."); // 0
            // Solve(5, "....#"); // 0
            // Solve(5, "...#."); // 1
            // Solve(6, ".###.."); // 2
            // Solve(6, ".#.#.#"); // 2
            // Solve(6, "#.#.#."); // 3
            // Solve(1, "."); // 0
            // Solve(1, "#"); // 0
            // Solve(2, ".."); // 0
            // Solve(2, ".#"); // 0
            // Solve(2, "#."); // 1
            // Solve(2, "##"); // 0
            // [.#]####
            // ....[.#]

            var N = long.Parse(Console.ReadLine());
            var S = Console.ReadLine();
            Solve(N, S);
        }

        static void Solve(long N, string S)
        {
            long count1 = 0; // ?#######との比較
            long count2 = 0; // ......?との比較
            Rep(S.Length, i =>
             {
                 if (S[(int)i] == '#')
                 {
                     ++count2;
                 }
                 else
                 {
                     ++count1;
                 }
             });
            if (S.Last() == '#')
            {
                --count2;
            }
            if (S.First() != '#')
            {
                --count1;
            }
            // if (count1 < 0)
            // {
            //     count1 = 0;
            // }
            // if (count2 < 0)
            // {
            //     count2 = 0;
            // }
            Console.WriteLine((int)(count1 >= count2 ? count2 : count1));
        }
    }
}