Description

Write a program to print the given symbol in the shape of an hourglass. For example, given $17$ "$*$", print them in the following format:

*****
 ***
  *
 ***
*****

An "hourglass shape" means that each line outputs an odd number of symbols; all lines are center-aligned; the number of symbols in adjacent lines differs by $2$; the number of symbols decreases from large to small down to $1$, then increases from small to large; the first and last lines have the same number of symbols.
Given any $N$ symbols, it may not be possible to form a perfect hourglass. You are required to print the largest possible hourglass using as many symbols as possible.

Input Format

A single line containing a positive integer $N$ ($N \le 1000$) and a symbol, separated by a space.

Output Format

First, print the largest hourglass shape composed of the given symbol. Finally, output the number of unused symbols on a single line.

Sample

19 *

*****
 ***
  *
 ***
*****
2