You are trying to solve the famous $N$ queens problem. You broke one of the queens from your chess pieces collections. Now, you have created the following puzzle:

You are given an $N\times N$ chessboard. Is it possible to place $N-1$ queens on it in such a way that no pair of queens is attacking each other?

Two queens are attacking each other if at least one of the following conditions is true:

• They share the same row
• They share the same column
• They share the same diagonal

You are given a single integer $N$. Print any possible configuration in the format below. It is guaranteed that there is always an answer.

Input format

The first and only line consists of a single integer $N$.

Output format

Print $N$ lines consisting of $N$ space-separated characters where a '$*$' represents a queen, and a '$.$' represents empty space. You can print extra spaces and newlines.

If there are multiple valid answers, then you can print any of them.

Constraints 

$2 \le N \le 1000$