#include <bits/stdc++.h>

using namespace std;

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	string res,s;
	vector <string> v;
	int n;
	priority_queue <pair<pair<int,int>, pair<int, int>>> pque;

	cin >> n;

	for (int i = 0; i < n; i++)
	{
		cin >> s;
		v.push_back(s);
	}

	for (int i = 0; i < n; i++)
	{
		int num = -1e9;
		if (1 < v[i].length())
		{
			num = -(v[i][1] - 'a');
		}
		pque.push(make_pair(make_pair(-(v[i][0]-'a'),num), make_pair(i, 0)));
	}

	while (!pque.empty())
	{
		int ch = -pque.top().first.first;
		int now = pque.top().second.first;
		int idx = pque.top().second.second;
		pque.pop();
		res += (char)(ch + 'a');

		if (idx + 1 < v[now].length())
		{
			int num = -1e9;
			if (idx+2 < v[now].length())
			{
				num = -(v[now][idx+2] - 'a');
			}
			pque.push(make_pair(make_pair(-(v[now][idx + 1]-'a'),num), make_pair(now, idx + 1)));
		}
	}

	cout << res << '\n';

	return 0;
}