Score : $200$ points

问题陈述

你得到了一段水平书写的文本。将其转换为垂直书写，用 * 填充空格。

你得到了 $N$ 个字符串 $S_1, S_2, \dots, S_N$，它们由小写英文字母组成。设 $M$ 为这些字符串的最大长度。

打印出 $M$ 个字符串 $T_1, T_2, \dots, T_M$，满足以下条件：

• 每个 $T_i$ 由小写英文字母和 * 组成。
• 每个 $T_i$ 不以 * 结尾。
• 对于每个 $1 \leq i \leq N$，以下条件成立：
  • 对于每个 $1 \leq j \leq |S_i|$，$T_j$ 的第 $(N-i+1)$ 个字符存在，并且按顺序连接 $T_1, T_2, \dots, T_{|S_i|}$ 的第 $(N-i+1)$ 个字符等于 $S_i$。
  • 对于每个 $|S_i| + 1 \leq j \leq M$，$T_j$ 的第 $(N-i+1)$ 个字符要么不存在，要么是 *。

在这里，$|S_i|$ 表示字符串 $S_i$ 的长度。

以上为大语言模型 kimi 翻译，仅供参考。

Problem Statement

You are given a horizontally written text. Convert it to vertical writing, filling spaces with *.

You are given $N$ strings $S_1, S_2, \dots, S_N$ consisting of lowercase English letters. Let $M$ be the maximum length of these strings.

Print $M$ strings $T_1, T_2, \dots, T_M$ that satisfy the following conditions:

• Each $T_i$ consists of lowercase English letters and *.
• Each $T_i$ does not end with *.
• For each $1 \leq i \leq N$, the following holds:
  • For each $1 \leq j \leq |S_i|$, the $(N-i+1)$-th character of $T_j$ exists, and the concatenation of the $(N-i+1)$-th characters of $T_1, T_2, \dots, T_{|S_i|}$ in this order equals $S_i$.
  • For each $|S_i| + 1 \leq j \leq M$, the $(N-i+1)$-th character of $T_j$ either does not exist or is *.

Here, $|S_i|$ denotes the length of the string $S_i$.

Constraints

• $N$ is an integer between $1$ and $100$, inclusive.
• Each $S_i$ is a string of lowercase English letters with length between $1$ and $100$, inclusive.

Input

The input is given from Standard Input in the following format:

$N$

$S_1$

$S_2$

$\vdots$

$S_N$

Output

Print the answer in the following format:

$T_1$

$T_2$

$\vdots$

$T_M$

Sample Input 1

3
abc
de
fghi

Sample Output 1

fda
geb
h*c
i

Placing * as the 2nd character of $T_3$ puts the c in the correct position. On the other hand, placing * as the 2nd and 3rd characters of $T_4$ would make $T_4$ end with *, which violates the condition.

Sample Input 2

3
atcoder
beginner
contest

Sample Output 2

cba
oet
ngc
tio
end
sne
ter
*r