The semester is already ending, so Danil made an effort and decided to visit a lesson on harmony analysis to know how does the professor look like, at least. Danil was very bored on this lesson until the teacher gave the group a simple task: find 4 vectors in 4-dimensional space, such that every coordinate of every vector is 1 or  - 1 and any two vectors are orthogonal. Just as a reminder, two vectors in *n*-dimensional space are considered to be orthogonal if and only if their scalar product is equal to zero, that is: 

Danil quickly managed to come up with the solution for this problem and the teacher noticed that the problem can be solved in a more general case for 2<sup class="upper-index">*k*</sup> vectors in 2<sup class="upper-index">*k*</sup>-dimensinoal space. When Danil came home, he quickly came up with the solution for this problem. Can you cope with it?
The only line of the input contains a single integer *k* (0 ≤ *k* ≤ 9).
Consider all scalar products in example:
 -  Vectors 1 and 2: ( + 1)·( + 1) + ( + 1)·( - 1) + ( - 1)·( + 1) + ( - 1)·( - 1) = 0 -  Vectors 1 and 3: ( + 1)·( + 1) + ( + 1)·( + 1) + ( - 1)·( + 1) + ( - 1)·( + 1) = 0 -  Vectors 1 and 4: ( + 1)·( + 1) + ( + 1)·( - 1) + ( - 1)·( - 1) + ( - 1)·( + 1) = 0 -  Vectors 2 and 3: ( + 1)·( + 1) + ( - 1)·( + 1) + ( + 1)·( + 1) + ( - 1)·( + 1) = 0 -  Vectors 2 and 4: ( + 1)·( + 1) + ( - 1)·( - 1) + ( + 1)·( - 1) + ( - 1)·( + 1) = 0 -  Vectors 3 and 4: ( + 1)·( + 1) + ( + 1)·( - 1) + ( + 1)·( - 1) + ( + 1)·( + 1) = 0
2
++++
+*+*
++**
+**+
1
++
+*
3
++++++++
+*+*+*+*
++**++**
+**++**+
++++****
+*+**+*+
++****++
+**+*++*
0
+
4
++++++++++++++++
+*+*+*+*+*+*+*+*
++**++**++**++**
+**++**++**++**+
++++****++++****
+*+**+*++*+**+*+
++****++++****++
+**+*++*+**+*++*
++++++++********
+*+*+*+**+*+*+*+
++**++****++**++
+**++**+*++**++*
++++********++++
+*+**+*+*+*++*+*
++****++**++++**
+**+*++**++*+**+
5
++++++++++++++++++++++++++++++++
+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*
++**++**++**++**++**++**++**++**
+**++**++**++**++**++**++**++**+
++++****++++****++++****++++****
+*+**+*++*+**+*++*+**+*++*+**+*+
++****++++****++++****++++****++
+**+*++*+**+*++*+**+*++*+**+*++*
++++++++********++++++++********
+*+*+*+**+*+*+*++*+*+*+**+*+*+*+
++**++****++**++++**++****++**++
+**++**+*++**++*+**++**+*++**++*
++++********++++++++********++++
+*+**+*+*+*++*+*+*+**+*+*+*++*+*
++****++**++++**++****++**++++**
+...
6
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*
++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**
+**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**+
++++****++++****++++****++++****++++****++++****++++****++++****
+*+**+*++*+**+*++*+**+*++*+**+*++*+**+*++*+**+*++*+**+*++*+**+*+
++****++++****++++****++++****++++****++++****++++****++++****++
+**+*++*+**+*++*+**+*++*+**+*++*+**+*++*+**+*++*+...
7
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*
++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**
+**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++**++...
8
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+...
9
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++...
k = int(input())

def reflect(matrix):
    temp = list(matrix)

    for i in range(len(matrix)):
        matrix[i] = list(matrix[i])

    temp.reverse()
    return temp

def invert(matrix):
    temp = list(matrix)

    for i in range(len(temp)):
        temp[i] = list(temp[i])

    for i in range(len(temp)):
        for j in range(len(temp[i])):
            temp[i][j] = not temp[i][j]

    return temp

seed = [[True]]

while k > 0:
    refl = reflect(seed)
    inve = invert(refl)

    seedlen = len(seed)
    invelen = len(inve)

    for i in range(seedlen):
        seed[i].extend(seed[i])

    for i in range(invelen):
        inve[i].extend(refl[i])

    seed.extend(inve)
    k -= 1


line = ''
for i in range(len(seed)):
    for j in range(len(seed[i])):
        if seed[i][j] == True:
            line += '+'
        else:
            line += '*'
    print(line)
    line = ''