// C++ program to find shortest superstring using Greedy
// Approximate Algorithm
#include <bits/stdc++.h>
using namespace std;
ifstream in("adn.in");
ofstream out("adn.out");
int findOverlappingPair(string str1, string str2, string &str)
{
    int max = INT_MIN;
    int len1 = str1.length();
    int len2 = str2.length();
    for (int i = 1; i <= min(len1, len2); i++)
    {
        if (str1.compare(len1-i, i, str2, 0, i) == 0)
        {
            if (max < i)
            {
                max = i;
                str = str1 + str2.substr(i);
            }
        }
    }
    for (int i = 1; i <= min(len1, len2); i++)
    {
        if (str1.compare(0, i, str2, len2-i, i) == 0)
        {
            if (max < i)
            {
                max = i;
                str = str2 + str1.substr(i);
            }
        }
    }

    return max;
}
string findShortestSuperstring(string arr[], int len)
{
    while(len != 1)
    {
        int max = INT_MIN;
        int l, r;
        string resStr;
        for (int i = 0; i < len; i++)
        {
            for (int j = i + 1; j < len; j++)
            {
                string str;
                int res = findOverlappingPair(arr[i], arr[j], str);
                if (max < res)
                {
                    max = res;
                    resStr.assign(str);
                    l = i, r = j;
                }
            }
        }
        len--;
        if (max == INT_MIN)
            arr[0] += arr[len];
        else
        {
            arr[l] = resStr;
            arr[r] = arr[len];
        }
    }
    return arr[0];
}
int main()
{
    int n;
    in>>n;
    string arr[n];
    for(int i=0;i<n;++i)
        in>>arr[i];
    int len = sizeof(arr)/sizeof(arr[0]);
    out<<findShortestSuperstring(arr, len);
    return 0;
}