#include <bits/stdc++.h>
const long long int INF = 1e18;
const double PI = 4 * atan(1);
using namespace std;
long long int mpow(long long int base, long long int exp);
void solve();
long long int POW(long long int base, long long int exp);
long long int gcd(long long int a, long long int b);
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i = 0, j = 0;
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}
void solve() {
  long long int k;
  cin >> k;
  if (k == 0) {
    cout << "*" << '\n';
    return;
  }
  long long int val = 1 << k;
  long long int a[val + 1][val + 1];
  for (long long int i = 0; i <= val; i++) {
    for (long long int j = 0; j <= val; j++) a[i][j] = 1;
  }
  a[0][0] = 1;
  a[1][1] = 1;
  a[1][2] = 1;
  a[2][1] = 1;
  a[2][2] = -1;
  for (long long int i = 2; i <= k; i++) {
    long long int prev = 1 << (i - 1);
    for (long long int j = 1; j <= prev; j++) {
      for (long long int k = prev + 1; k <= 2 * prev; k++) {
        a[k][j] = a[k - prev][j];
      }
    }
    for (long long int j = prev + 1; j <= 2 * prev; j++) {
      for (long long int k = 1; k <= prev; k++) {
        a[k][j] = a[k][j - prev];
      }
    }
    for (long long int j = prev + 1; j <= 2 * prev; j++) {
      for (long long int k = prev + 1; k <= 2 * prev; k++) {
        a[k][j] = -a[k - prev][j - prev];
      }
    }
  }
  for (long long int i = 1; i <= val; i++) {
    for (long long int j = 1; j <= val; j++) {
      if (a[i][j] == 1)
        cout << '+';
      else
        cout << '*';
    }
    cout << '\n';
  }
}
long long int POW(long long int base, long long int exp) {
  long long int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long int)result * base);
    base = ((long long int)base * base);
    exp >>= 1;
  }
  return result;
}
long long int mpow(long long int base, long long int exp) {
  base %= 1000000007;
  long long int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long int)result * base) % 1000000007;
    base = ((long long int)base * base) % 1000000007;
    exp >>= 1;
  }
  return result;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
