/*
#include <stdlib.h>
int main()
{
printf("Hello world!\n");
return 0;
}
*/
#include <stdio.h>
char arr[1001][1001]={};
int queue[2][501]={};
int back = -1;
int front = -1;
int n,x,y,m=0,px,py;
void push( int x, int y ){
back++;
queue[0][back] = x;
queue[1][back] = y;
arr[x][y]='*';
}
void bfs(int x, int y){
push(x,y);
while(front != back){
pop();
if(py-1>=1 && arr[px][py-1] == ' ' && py>arr[x][n-1] ) {
else
{
push(px,py-1);
}
}
if(py+1<=2*n && arr[px][py+1] == ' ' ) {
push(px,py+1);
}
if(px-1>=1 && arr[px-1][py] == ' ' ) {
push(px-1,py);
}
if(py+1<=2*n && arr[px+1][py] == ' ' ) {
push(px+1,py);
}
}
}
void pop( )
{
if(front == back)
{
return ;
}
front ++;
px = queue[0] [front];
py = queue[1][front];
}
int main()
{
scanf("%d",&n);
for(int i=1; i<=n*2; i++)
{
for(int j=1; j<=n*2; j++)
{
arr[i][j] = ' ';
}
}
bfs(n,n);
for(int i=1; i<=n*2; i++)
{
for(int j=1; j<=n*2; j++)
{
if(arr[i][j]=='*') printf("*");
else printf(" ");
}
printf("\n");
}
return 0;
}