CF1200E.Compress Words

Amugae has a sentence consisting of $n$ words. He want to compress this sentence into one word. Amugae doesn't like repetitions, so when he merges two words into one word, he removes the longest prefix of the second word that coincides with a suffix of the first word. For example, he merges "sample" and "please" into "samplease".

Amugae will merge his sentence left to right (i.e. first merge the first two words, then merge the result with the third word and so on). Write a program that prints the compressed word after the merging process ends.

Amugae 有一句由 $n$ 个单词组成的句子。他想将该句子压缩为一个单词。Amugae 不喜欢重复，因此当他把两个单词合并为一个单词时，他会删去第二个单词的、与第一个单词的后缀相匹配的最长前缀。例如，他将 “sample” 和 “please” 合并为 “samplease”。

Amugae 将按从左到右的顺序合并句子（即先合并前两个单词，再将结果与第三个单词合并，依此类推）。请编写一个程序，输出合并过程结束后得到的压缩后的单词。

The first line contains an integer $n$ ($1 \le n \le 10^5$), the number of the words in Amugae's sentence.

The second line contains $n$ words separated by single space. Each words is non-empty and consists of uppercase and lowercase English letters and digits ('A', 'B', ..., 'Z', 'a', 'b', ..., 'z', '0', '1', ..., '9'). The total length of the words does not exceed $10^6$.

第一行包含一个整数 $n$（$1 \le n \le 10^5$），表示 Amugae 句子中的单词数量。

第二行包含 $n$ 个由单个空格分隔的单词。每个单词非空，且仅由大写和小写英文字母以及数字（'A', 'B', ..., 'Z', 'a', 'b', ..., 'z', '0', '1', ..., '9'）组成。所有单词的总长度不超过 $10^6$。

In the only line output the compressed word after the merging process ends as described in the problem.

在唯一的一行中输出按题目描述完成合并过程后的压缩单词。