Special Square

Problem Description

Given $n$, output an $n \times n$ square made of + and ., where the outermost ring is all +, the second ring is all ., and so on. For the $i$-th ring, if $i$ is odd then it is all +, otherwise it is all ..

Input Format

A single line containing one integer $n$.

Output Format

Output $n$ lines forming the required square. There must be no trailing spaces at the end of any line.

Sample Input

10

Sample Output

++++++++++
+........+
+.++++++.+
+.+....+.+
+.+.++.+.+
+.+.++.+.+
+.+....+.+
+.++++++.+
+........+
++++++++++

Constraints

For $100\%$ of the data, $2 \le n \le 100$.