#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = (1 << 9) + 3;
int k;
int a[MAXN][MAXN];
void dien(int x) {
  if (x == 1) return;
  dien(x / 2);
  for (int i = 1; i <= x / 2; i++) {
    for (int j = 1; j <= x / 2; j++) {
      a[i + x / 2][j] = a[i][j + x / 2] = a[i][j];
      a[i + x / 2][j + x / 2] = 1 - a[i][j];
    }
  }
}
int main() {
  cin >> k;
  dien(1 << k);
  for (int i = 1; i <= 1 << k; i++) {
    for (int j = 1; j <= 1 << k; j++) {
      if (a[i][j] == 0)
        cout << '*';
      else
        cout << '+';
    }
    cout << endl;
  }
  return 0;
}
