CodeForces 632C The Smallest String Concatenation

You're given a list of n strings a₁, a₂, ..., 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⁴).

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

Output

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

Sample Input

Input

4
abba
abacaba
bcd
er

Output

abacabaabbabcder

Input

5
x
xx
xxa
xxaa
xxaaa

Output

xxaaaxxaaxxaxxx

Input

3
c
cb
cba

Output

cbacbc

分析：对于每两个串之间如果要连接之后的串字典序最小，就只需要考虑两个串连接后的字典序大小，排序即可

#include<cstring>
#include<string>
#include<iostream>
#include<queue>
#include<cstdio>
#include<algorithm>
#include<map>
#include<cstdlib>
#include<cmath>
#include<vector>
//#pragma comment(linker, "/STACK:1024000000,1024000000");

using namespace std;

#define INF 0x3f3f3f3f

string s[50004];

bool cmp(string a,string b)
{
    return a+b<b+a;
}

int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++) cin>>s[i];
    sort(s,s+n,cmp);
    for(int i=0;i<n;i++) cout<<s[i];
    cout<<endl;
    return 0;
}