#include <bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin >> n;

    vector<string> crown = {"  *  ", " * * ", "* * *"};

    for(int lv = 2; lv <= n; lv++){
        int prev_w = crown[0].size();
        int pad = (prev_w + 1) / 2;
        string sp(pad, ' ');

        vector<string> next;
        for(auto &row : crown)
            next.push_back(sp + row + sp);
        for(auto &row : crown)
            next.push_back(row + " " + row);
        crown = move(next);
    }

    int width = crown[0].size();
    for(auto &row : crown){
        int last = row.size() - 1;
        while(last >= 0 && row[last] == ' ') last--;
        cout << row.substr(0, last + 1) << "\n";
    }
    string trunk(width / 2, ' ');
    trunk += '*';
    for(int i = 0; i < n; i++)
        cout << trunk << "\n";

    return 0;
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<String> crown = new ArrayList<>(Arrays.asList("  *  ", " * * ", "* * *"));

        for (int lv = 2; lv <= n; lv++) {
            int prevW = crown.get(0).length();
            int pad = (prevW + 1) / 2;
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < pad; i++) sb.append(' ');
            String sp = sb.toString();

            List<String> next = new ArrayList<>();
            for (String row : crown)
                next.add(sp + row + sp);
            for (String row : crown)
                next.add(row + " " + row);
            crown = next;
        }

        int width = crown.get(0).length();
        StringBuilder out = new StringBuilder();
        for (String row : crown) {
            int last = row.length() - 1;
            while (last >= 0 && row.charAt(last) == ' ') last--;
            out.append(row, 0, last + 1).append('\n');
        }

        int mid = width / 2;
        StringBuilder t = new StringBuilder();
        for (int i = 0; i < mid; i++) t.append(' ');
        t.append('*');
        String trunk = t.toString();
        for (int i = 0; i < n; i++)
            out.append(trunk).append('\n');

        System.out.print(out);
    }
}

import sys

def solve():
    n = int(input())
    crown = ["  *  ", " * * ", "* * *"]

    for lv in range(2, n + 1):
        prev_w = len(crown[0])
        pad = " " * ((prev_w + 1) // 2)
        top = [pad + row + pad for row in crown]
        bottom = [row + " " + row for row in crown]
        crown = top + bottom

    width = len(crown[0])
    output = []
    for row in crown:
        output.append(row.rstrip())
    trunk = " " * (width // 2) + "*"
    for _ in range(n):
        output.append(trunk)
    sys.stdout.write("\n".join(output) + "\n")

solve()

const readline = require('readline');
const rl = readline.createInterface({ input: process.stdin });

rl.on('line', (line) => {
    const n = parseInt(line.trim());
    let crown = ["  *  ", " * * ", "* * *"];

    for (let lv = 2; lv <= n; lv++) {
        const prevW = crown[0].length;
        const pad = ' '.repeat((prevW + 1) / 2);
        const next = [];
        for (const row of crown)
            next.push(pad + row + pad);
        for (const row of crown)
            next.push(row + " " + row);
        crown = next;
    }

    const width = crown[0].length;
    const lines = crown.map(row => row.trimEnd());
    const trunk = ' '.repeat(Math.floor(width / 2)) + '*';
    for (let i = 0; i < n; i++)
        lines.push(trunk);
    console.log(lines.join('\n'));
    rl.close();
});