#include <bits/stdc++.h>
using namespace std;
const int maxn = 515;
char a[maxn][maxn][10];
void solve(int x);
int main() {
  int n;
  cin >> n;
  a[0][0][0] = '+';
  for (int i = 1; i <= n; i++) solve(i);
  for (int i = 0; i < pow(2, n); i++) {
    for (int j = 0; j < pow(2, n); j++) cout << a[i][j][n];
    cout << endl;
  }
}
void solve(int x) {
  int t = pow(2, x);
  int m = pow(2, x - 1);
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j][x] = a[i][j][x - 1];
      a[i + m][j][x] = a[i][j][x];
      a[i][j + m][x] = a[i][j][x];
    }
  }
  for (int i = m; i < t; i++) {
    for (int j = m; j < t; j++) {
      if (a[i - m][j - m][x - 1] == '+')
        a[i][j][x] = '*';
      else
        a[i][j][x] = '+';
    }
  }
}
