#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int arr[50],num[50];
char str[10];
int main(){
int n,m,i,j,k,ans;
k = 1;
ans = 0 ;
for(i = 1;i <= 50;++ i){
arr[i] = k;
k += 2;
}
k = 3;
for(i = 1;i <= 30;++ i){
if(i>1){
num[i] = num[i-1]+2*k;
k += 2;
}
else
num[i] = 1;
//printf("%d\n",num[i]);
}
while(~scanf("%d",&n)){
scanf("%s",str);
for(i = 23;i >= 1;-- i){
//cout<<n<<" "<<num[i]<<endl;
if(n >= num[i])
//cout<<num[i]<<endl;
break;
}
if(i == 1){
printf("%c\n",str[0]);
}
else{
int tmp = 0;
for(j = i;j >= 1;j--){
for(k = 0;k < tmp;++ k){
printf(" ");
}
tmp++;
for(k = arr[j];k >= 1;--k ){
printf("%c",str[0]);
}
printf("\n");
}
for(j = 2;j <= i;++ j){
for(k = 2;k < tmp;++ k){
printf(" ");
}
tmp--;
for(k = 1;k <= arr[j];++k ){
printf("%c",str[0]);
}
printf("\n");
}
}
printf("%d\n",n-num[i]);
}
return 0;
}