Problem2061--The Smallest String Concatenation

2061: The Smallest String Concatenation

Time Limit: 2 Sec  Memory Limit: 256 MB
Submit: 0  Solved: 0
[Submit] [Status] [Web Board] [Creator:]

Description

time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You're given a list of n strings a1,a2,...,an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.

Given the list of strings, output the lexicographically smallest concatenation.

Input

The first line contains integer n − the number of strings (1≤n≤5·104).

Each of the next n lines contains one string ai (1≤|ai|≤50) consisting of only lowercase English letters. The sum of string lengths will not exceed 5·104.

Output

Print the only string a − the lexicographically smallest string concatenation.

Examples
Input
4
abba
abacaba
bcd
er
Output
abacabaabbabcder
Input
5
x
xx
xxa
xxaa
xxaaa
Output
xxaaaxxaaxxaxxx
Input
3
c
cb
cba
Output
cbacbc

Source/Category

 
[Submit] [Status]