Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. The Smallest String Concatenation

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou're given a list of *n* strings *a*_{1}, *a*_{2}, ..., *a*_{n}. 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·10^{4}).

Each of the next *n* lines contains one string *a*_{i} (1 ≤ |*a*_{i}| ≤ 50) consisting of only lowercase English letters. The sum of string lengths will not exceed 5·10^{4}.

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

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/27/2017 16:12:16 (c3).

Desktop version, switch to mobile version.
User lists

Name |
---|