There is a square-shaped grid with $N$ vertical rows and $N$ horizontal columns. We will denote the square at the $i$\-th row from the top and the $j$\-th column from the left as $(i,\ j)$.
Initially, each square is either white or black. The initial color of the grid is given to you as characters $a_{ij}$, arranged in a square shape. If the square $(i,\ j)$ is white, $a_{ij}$ is `.`. If it is black, $a_{ij}$ is `#`.
You are developing a robot that repaints the grid. It can repeatedly perform the following operation:
* Select two integers $i$, $j$ ($1 ≤ i,\ j ≤ N$). Memorize the colors of the squares $(i,\ 1)$, $(i,\ 2)$, $...$, $(i,\ N)$ as $c_1$, $c_2$, $...$, $c_N$, respectively. Then, repaint the squares $(1,\ j)$, $(2,\ j)$, $...$, $(N,\ j)$ with the colors $c_1$, $c_2$, $...$, $c_N$, respectively.
Your objective is to turn all the squares black. Determine whether it is possible, and find the minimum necessary number of operations to achieve it if the answer is positive.
## Constraints
* $2 ≤ N ≤ 500$
* $a_{ij}$ is either `.` or `#`.
## Input
The input is given from Standard Input in the following format:
$N$
$a_{11}$$...$$a_{1N}$
$:$
$a_{N1}$$...$$a_{NN}$
## Partial Score
* In a test set worth $300$ points, $N ≤ 3$.
[samples]