Preparing NOJ

# Compress Words

1000ms 262144K

## Description:

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.

## Input:

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$.

## Output:

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

## Sample Input:

5
I want to order pizza

Iwantorderpizza

5

## Sample Output:

Info

Provider CodeForces

Code CF1200E

Tags

brute forcehashingimplementationstring suffix structuresstrings

Submitted 84

Passed 24

AC Rate 28.57%

Date 11/19/2019 15:56:05

Related

Nothing Yet