PROGRAMMING:Recursive output of fractal

Fractal has the morphological characteristics of filling space in the form of non integer dimension. It is usually defined as "a rough or fragmentary geometric shape, which can be divided into several parts, and each part is (at least approximately) the reduced shape of the whole", that is, it has the property of self similarity.
A box fractal is defined as follows:
The box fractal of degree 1 is as follows
```
X
```
The box fractal of degree 2 is as follows
```
X X
X
X X
```
By analogy, if B (n-1) represents a box fractal of n-1 degree, then the recursive definition of box fractal of n degree is as follows:
```
B(n - 1) B(n - 1)
B(n - 1)
B(n - 1) B(n - 1)
```
Please draw the box fractal of degree n
###Input format:
Enter a series of degrees, each line gives a positive integer not greater than 7. The last line of input ends with - 1
###Output format:
For each use case, the box fractal marked with 'x' is output** After each test case, the output contains a line with a dash -**
###Input example:
```in
one
two
three
four
-1
```
###Output example:
**Note: Please output the complete space of each line**
```out
X
-
X X
X
X X
-
X X X X
X X
X X X X
X X
X
X X
X X X X
X X
X X X X
-
X X X X X X X X
X X X X
X X X X X X X X
X X X X
X X
X X X X
X X X X X X X X
X X X X
X X X X X X X X
X X X X
X X
X X X X
X X
X
X X
X X X X
X X
X X X X
X X X X X X X X
X X X X
X X X X X X X X
X X X X
X X
X X X X
X X X X X X X X
X X X X
X X X X X X X X
-
```







answer：If there is no answer, please comment