X-Shaped Grid

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given a positive odd $n$, print an $n$-by-$n$ grid. Cell $(i,j)$ is X if $i=j$ or $i+j=n+1$, and . otherwise. The diagonals meet at one central cell, which is printed once.

Input

One line contains odd integer $n$.

Output

Print exactly $n$ lines, each of $n$ adjacent characters.

Subtasks

• Subtask 1 (20%): $1\le n\le 5$ and $n$ is odd.

• Subtask 2 (30%): $1\le n\le 15$ and $n$ is odd.

• Subtask 3 (50%): $1\le n\le 31$ and $n$ is odd.

Examples

Example 1

Input:

3

Output:

X.X
.X.
X.X

Explanation:

For n=3, X appears on either diagonal and the center is printed only once.

Example 2

Input:

1

Output:

X

Explanation:

For n=1, X appears on either diagonal and the center is printed only once.