Application List
time limit per test
2 seconds
memory limit per test
512 mebibytes
input
standard input
output
standard output

In a distant land, there lived a wise elder who was the keeper of all computer programs that ever existed. One day, the ruler of the land decreed to create a list all the programs, and the elder decided to do it by creating an Application List that would display the presence or absence of various applications.

He turned to you for help in this important task. You are given a list of programs with names consisting of lowercase English letters.

Your task is to fill a table of five rows and six columns. The first 26 cells of the table correspond to letters "a", "b", ..., "z" in alphabetic order. The last four cells are empty. Each cell contains the corresponding letter if there is at least one program in the list whose name starts with that letter. If there are no such programs, a dot should be placed instead.

Input

The first line contains an integer $$$n$$$: the number of programs ($$$0 \le n \le 100$$$). Next, there are $$$n$$$ lines listing the program names. Each name contains from $$$1$$$ to $$$20$$$ lowercase English letters.

Output

Output the Application List in the format described above: five lines with letters and dots, without spaces between them. The first four lines must contain six characters each. The last line must contain two characters.

Example

Input
10
apple
banana
cherry
date
eggplant
fig
grape
kiwi
lemon
mango
Output
abcdef
g...kl
m.....
......
..