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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.io.*;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args)
    {
        Reader r=new Reader();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        int N=r.nextInt();
        String str=r.next();
        solve(str, out);
        out.close();


    }
    static void solve(String str, PrintWriter out)
    {
        int numBlack=0;
        int numWhite=0;
        for(int i=0; i<str.length(); i++)
        {
            if(str.charAt(i)=='#')
            {
                numBlack++;
            }
            else {
                numWhite++;
            }
        }
        if(!hasWhite(str))
        {
            out.println(0);
        }
        else if(numBlack>=numWhite)
        {

                out.println(numWhite);

        }
        else if(numBlack<numWhite)
        {
            if(str.charAt(str.length()-1)=='#')
            {
                out.println(numBlack-1);
            }
            else
            {
            out.println(numBlack);
            }
        }
    }
    static boolean hasWhite(String str)
    {
        for(int i=0; i<str.length(); i++)
        {
            if(str.charAt(i)=='#' && str.charAt(i+1)=='w')
            {
                return true;
            }
        }

        return false;
    }

    //Fast I/O class
    static class Reader
    {
        BufferedReader br;
        StringTokenizer st;

        public Reader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }


}