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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
#include <stdint.h>

int getNumsInt32(int32_t *buf, int32_t num)
{
  int32_t i;

  for (i = 0; i < num; i++) {
    if (scanf("%d", &buf[i]) == EOF) {
      return -1;
    }
  }
  return 0;
}

int main()
{
  int32_t num, i, j, change = 0, change2 = 0;
  char s[200000];
  char sb[200000];

  if (getNumsInt32((int32_t *)&num, (int32_t)1) == -1) {
    return -1;
  }

  if (scanf("%s", s) == EOF) {
    return -1;
  }

  strncpy(sb, s, num);

  for (i = 1; i < num; i++) {
    if (s[i - 1] == '#' && s[i] == '.') {
      s[i] = '#';
      change++;
    }
  }

  for (i = 1; i < num; i++) {
    if (sb[i - 1] == '#' && sb[i] == '.') {
      sb[i - 1] = '.';
      change2++;
      for (j = i - 2; j >= 0; j--) {
        if (sb[j] == '#') {
          sb[j] = '.';
          change2++;
        }
        else {
          break;
        }
      }
    }
  }

  if (change2 > 0) {
    if (change > change2) {
      change = change2;
    }
  }

  printf("%d\n", change);

  return 0;
}