A9967. Weird Chess

The first line contains a single integer $n$ ( $1<=n<=50$ ).

The next $n$ lines contain $n$ characters each describing the position offered by Igor. The $j$ -th character of the $i$ -th string can have the following values:

- o — in this case the field $(i,j)$ is occupied by a piece and the field may or may not be attacked by some other piece;
- x — in this case field $(i,j)$ is attacked by some piece;
- . — in this case field $(i,j)$ isn't attacked by any piece.

It is guaranteed that there is at least one piece on the board.

If there is a valid set of moves, in the first line print a single word 'YES' (without the quotes). Next, print the description of the set of moves of a piece in the form of a $(2n-1)×(2n-1)$ board, the center of the board has a piece and symbols 'x' mark cells that are attacked by it, in a format similar to the input. See examples of the output for a full understanding of the format. If there are several possible answers, print any of them.

If a valid set of moves does not exist, print a single word 'NO'.

In the first sample test the piece is a usual chess rook, and in the second sample test the piece is a usual chess knight.

In the first sample test the piece is a usual chess rook, and in the second sample test the piece is a usual chess knight.