Description
Despite being able to destroy a city and an entire army, Nappa is really bad at spelling. Luckily, his good friend Vegeta is going to help him so that Nappa does not have to ask him too many questions.
In order to do this, Vegeta needs to develop a program that creates alphabets in a pattern Nappa is familiar with, pyramids, then he will test Nappa with the program. If Napppa fails the test, he will be destroyed.
The program Vegeta needs to create will require a single integer as an input which will determine the layers a pyramid has. At the center of the pyramid, there will be firsst letter of the alphabet and it will be surrounded by layers of following alphabets.
Vegeta needs to make this program quick before he gets an aneurism from Nappa's stupidity.
Input
N
N will only be in range of the total number of alphabets.
Output
Lowercase alphabet pyramid
Detail will show in sample output
Remember to put "\n" in every line