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 Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

PROGRAM ATCODER

implicit none
integer :: n,ans_b=0,ans_w=0,i
character(len=2*10**5) ::  s

read*, n,s

do i = 1, n
  if ( s(i:i) == '#' ) then
    ans_b = ans_b + 1
  else
    ans_w = ans_w + 1
  end if
end do

print'(i0)', min(ans_b,ans_w)

END PROGRAM ATCODER