#include <cstdio>
#include <algorithm>

using namespace std;

int n, tmp[40];

void solve(int x, int a, int b)
{
	if( a == 0 )
    {
		for(int i = 0 ; i < x ; i++, puts("") )
            for(int j = 0 ; j < tmp[i] ; j++ )
                printf("*");
		puts("");
		return;
	}
	for(int i = min(a,b) ; i > 0 ; i-- )
        tmp[x] = i, solve(x+1, a-i, i);
}

main(){
    for(int i = 1 ; i <= 20 ; i++ )
    {
        char in[100], out[100];
        sprintf(in, ".%d.in", i);
        sprintf(out, ".%d.out", i);
        freopen(in, "r", stdin);
        freopen(out, "w", stdout);
        scanf("%d", &n);
        solve(0, n, n);
    }
}