// C++ program to find shortest
// superstring using Greedy
// Approximate Algorithm
#include <bits/stdc++.h>
using namespace std;

// Utility function to calculate
// minimum of two numbers
int min(int a, int b)
{
	return (a < b) ? a : b;
}

// Function to calculate maximum
// overlap in two given strings
int findOverlappingPair(string str1,
					string str2, string &str)
{
	
	// Max will store maximum
	// overlap i.e maximum
	// length of the matching
	// prefix and suffix
	int max = INT_MIN;
	int len1 = str1.length();
	int len2 = str2.length();

	// Check suffix of str1 matches
	// with prefix of str2
	for (int i = 1; i <=
					min(len1, len2); i++)
	{
		
		// Compare last i characters
		// in str1 with first i
		// characters in str2
		if (str1.compare(len1-i, i, str2,
								0, i) == 0)
		{
			if (max < i)
			{
				// Update max and str
				max = i;
				str = str1 + str2.substr(i);
			}
		}
	}

	// Check prefix of str1 matches
	// with suffix of str2
	for (int i = 1; i <=
						min(len1, len2); i++)
	{
		
		// compare first i characters
		// in str1 with last i
		// characters in str2
		if (str1.compare(0, i, str2,
							len2-i, i) == 0)
		{
			if (max < i)
			{
				
				// Update max and str
				max = i;
				str = str2 + str1.substr(i);
			}
		}
	}

	return max;
}

// Function to calculate
// smallest string that contains
// each string in the given
// set as substring.
string findShortestSuperstring(string arr[],
									int len)
{
	
	// Run len-1 times to
	// consider every pair
	while(len != 1)
	{
		
		// To store maximum overlap
		int max = INT_MIN;
	
		// To store array index of strings
		int l, r;
	
		// Involved in maximum overlap
		string resStr;
	
		// Maximum overlap
		for (int i = 0; i < len; i++)
		{
			for (int j = i + 1; j < len; j++)
			{
				string str;

				// res will store maximum
				// length of the matching
				// prefix and suffix str is
				// passed by reference and
				// will store the resultant
				// string after maximum
				// overlap of arr[i] and arr[j],
				// if any.
				int res = findOverlappingPair(arr[i],
										arr[j], str);

				// check for maximum overlap
				if (max < res)
				{
					max = res;
					resStr.assign(str);
					l = i, r = j;
				}
			}
		}

		// Ignore last element in next cycle
		len--;

		// If no overlap, append arr[len] to arr[0]
		if (max == INT_MIN)
			arr[0] += arr[len];
		else
		{
		
			// Copy resultant string to index l
			arr[l] = resStr;
		
			// Copy string at last index to index r
			arr[r] = arr[len];
		}
	}
	return arr[0];
}

// Driver program
int main()
{
  int n;
  cin>>n;
  
	string arr[n];
	
  for(int i=0;i<n;i++){
    cin>>arr[i];
  }

	int len = sizeof(arr)/sizeof(arr[0]);

	// Function Call
	cout << "The Shortest Superstring is \n"
		<< findShortestSuperstring(arr, len);

	return 0;
}
// This code is contributed by Aditya Goel