Stencil
Once upon a time in a programming class, while the instructor was explaining matrix operations, Petya had an idea to use a two-dimensional matrix for drawing patterns.
He took a sheet of graph paper and cut out a square of size N×N cells. From this square, Petya removed some cells, creating a stencil with a square shape and cut-out cells.
Here's what Petya does next: He takes another sheet of graph paper, also N×N in size, places the stencil on top, and colors the cells of the bottom sheet through the stencil. Then, he rotates the stencil 90^{o} clockwise and colors the cells again. He repeats this process two more times. In total, Petya colors the cells of the bottom sheet four times — with the stencil positioned at 0^{o}, 90^{o}, 180^{o}, and 270^{o} relative to its original orientation.
The stencil Petya uses is provided. Your task is to determine how many cells on the bottom sheet will be colored after completing the described procedure.
Input
The input file describes the stencil.
The first line contains a single natural number N (1 ≤ N ≤ 1000) — the size of the stencil in cells.
The following N lines contain only the characters 'X' (uppercase Latin letter X) and '.' (dot). Each line is N characters long and represents one row of the stencil. The character 'X' indicates a cut-out cell.
Output
Output the number of cells that will be colored as a result of the procedure described above.