For Mirko there is no greater happiness than finding a new roll of sticky tape, and today he is especially happy because he had also found Slavko's Advent calendar.

The Advent calendar can be represented as a table with ~n~ rows and ~m~ columns. Each square contains a little window, and behind each window is a piece of chocolate. Slavko had already opened some of the windows, and others are still closed.

Mirko decided to use his sticky tape to glue all closed windows shut. The tape is infinitely long, and it is one calendar cell wide. Mirko can rip off a piece of tape and use it to glue some sequence of horizontally or vertically adjacent closed windows shut. He doesn't want to put more than one piece of tape over some window, since he wants to remain friends with Slavko.

He is wondering what is the minimal number of pieces of tape he needs to glue all closed windows shut.

Input

The first line contains integers ~n~ and ~m~ ~(1 \le n \le 1\,000, 1 \le m \le 10)~, dimensions of the Advent calendar.

Each of the following ~n~ lines contains ~m~ characters . and # that represent the Advent calendar. The character . denotes an open window, and the character# denotes a closed window.

Output

Output the minimal number of pieces of tape needed to glue all closed windows shut.

Scoring

Subtask	Score	Constraints
~1~	~35~	Each closed window is adjacent to (shares a side with) at most two other closed windows.
~2~	~35~	~1 \le n \le 10~
~3~	~40~	No additional constraints.

Sample Input 1

2 3
#.#
###

Sample Output 1

3

Explanation for Sample Output 1

One possible solution is to use one piece of tape for the first column, one piece for the third column, and one piece for the window in the second row and second column.

Sample Input 2

4 3
.#.
###
.##
.#.

Sample Output 2

3

Sample Input 3

4 4
####
#.#.
#.##
####

Sample Output 3

5