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 Rust (1.15.1) (judge verdict: Wrong Answer)

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn get<T: std::str::FromStr + Clone>() -> T {
    let line = read_vec::<T>();
    line[0].clone()
}

fn to_vec(string: String) -> Vec<char > {
    let mut vec = Vec::<char>::new();
    for c in string.chars() {
        vec.push(c);
    }
    vec
}

fn main() {
    let n = get::<usize>();
    let _s = get::<String>();
    let s = to_vec(_s);

    let mut black = 0;
    let mut white = 0;
    let mut count_up = false;

    for x in 0..n {
        let c = s[x];
        if c == '#' {
            if x < n - 1 {
                count_up = true;
                black += 1;
            }
        } else {
            if count_up {
                white += 1;
            }
        }
    }

    println!("{}", std::cmp::min(black, white));
}