#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp(const string &s1, const string& s2)
{
    return s1<s2;
}
int main()
{
    vector<string> vs;
    string str;
    string str1;
    vector<string> vso;
    int n = 0;
    while (cin >> n)
    {
        if (cin.get() == ' ')
            break;
    }
    while (cin >> str)
    {
        vs.push_back(str);
        if (cin.get() == '\n')
            break;
    }
    for (int i = 0; i<vs.size(); i++)
    {
        int len = vs[i].length();
        if (len % 8 != 0)
        {
            vs[i].resize(len + 8 - len % 8, '0');
            for(int j = 0; j<vs[i].length() / 8; j++)
            {
                str1= vs[i].substr(j * 8, 8);
                vso.push_back(str1);
            }
        }
        else if (len == 0)
        {
            i++;
         }
        else
        {
            for (int k = 0; k<vs[i].length() / 8; k++)
            {
                str1 = vs[i].substr(k * 8, 8);
                vso.push_back(str1);
            }
        }
    }
    sort(vso.begin(), vso.end(), cmp);
    for (int m = 0; m<vso.size(); m++)
    {
        cout << vso[m]<< " ";
    }
    return 0;
}