After quite a lot of effort Bytie has finally managed to put $ n $ rooks on a board of size $ n $ × $ n $ so that no two of them attack each other. A quick reminder: a rook attacks all the fields of the board that are located in the same row or in the same column as it is^{1}.
Unfortunately, the boy has now accidentally hit the board. As a result, several rooks have fallen down from it. Could you help Bytie put these rooks back on the board? The boy would like to leave the rooks that are still on the board intact.
- See also http://en.wikipedia.org/wiki/Rook_(chess))
Input Format
The first line of the standard input contains one integer $ n $ ($2 \le n \le 1\,000$) that represents the size of the board. A description of the configuration of the rooks follows: the following $ n $ lines contain $ n $ characters each. The character '.' represents an empty field whereas the letter 'W' represents a field occupied by a rook.
You can assume that there are $ w $ rooks on the board with $1 \le w \le n-1$ and that no pair of rooks on the board attacks each other.
Output Format
Your program should write to the standard output $ n $ lines containing $ n $ characters '.' or 'W' each: the final configuration of rooks on the board. The description should contain exactly $ n $ occurrences of the letter 'W' with $ w $ rooks placed in the same positions as in the initial board. No two rooks may attack each other. If there are multiple ways of placing $ n - w $ rooks on the initial board, your program should output any one of them.
Example
Input
8 ........ .....W.. ..W..... .......W W....... ........ .W...... ........
Output
...W.... .....W.. ..W..... .......W W....... ....W... .W...... ......W.