#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
const int INF = (int)1e9 + 7, mod = (int)1e9 + 9, pw = 31, N = (int)1e5 + 123,
          M = (int)1e6 + 123;
const double eps = 1e-11;
const long long inf = 1e18;
struct node {
  int a[1000][1000];
  node() { memset(a, 0, sizeof a); }
} ans;
void get(int n) {
  if (!n) {
    ans.a[0][0] = 1;
    return;
  }
  get(n - 1);
  for (int i = (1 << (n - 1)) + 1; i <= (1 << n); i++) {
    for (int j = 0; j <= (1 << (n - 1)); j++) {
      ans.a[i][j] = ans.a[i - (1 << (n - 1))][j];
    }
  }
  for (int i = 0; i <= (1 << (n - 1)); i++) {
    for (int j = (1 << (n - 1)) + 1; j <= (1 << n); j++) {
      ans.a[i][j] = ans.a[i][j - (1 << (n - 1))];
    }
  }
  for (int i = (1 << (n - 1)) + 1; i <= (1 << n); i++) {
    for (int j = (1 << (n - 1)) + 1; j <= (1 << n); j++) {
      ans.a[i][j] = !ans.a[i][j - (1 << (n - 1))];
    }
  }
}
int n;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n;
  get(n);
  for (int i = 1; i <= (1 << n); i++) {
    for (int j = 1; j <= (1 << n); j++) cout << (ans.a[i][j] ? '+' : '*');
    cout << "\n";
  }
  return 0;
}
