#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <string>

using namespace std;

size_t n;

bool check(string s)
{
    size_t si = s.length();
    for (size_t i = 0; i < si / 2; i++)
        if (s[i] != s[si - i - 1])
            return false;
    return true;
}


string reverse(string s)
{
    string t = "";
    size_t si = s.length();
    for (size_t i = si; i > 0; i--)
        t += s[i - 1];
    return t;
}

int solve(const vector<string> & a, const vector<string> &b, const int rv_ans)
{
    vector<string> nor = a;
    vector<string> inv = b;
    inv.push_back("-");
    inv.push_back("a");
    sort(inv.begin(), inv.end());

    for (size_t i = 0; i < n; i++)
    {
        size_t si = nor[i].length();
        for (size_t j = 1; j <= si; j++)
        {
            string p = nor[i].substr(0, j);
            string s = *lower_bound(inv.begin(), inv.end(), p);
            string rev = reverse(s);
            if (s == nor[i].substr(0, j) && rev != nor[i])
            {
                string t = nor[i].substr(j, nor[i].length());
                for (size_t k = 0; k < n; k++)
                {
                    if (i != k && check(t + nor[k]) && rev != nor[k])
                    {
                        string ans = nor[i] + " " + nor[k] + " " + rev;
                        if (rv_ans == 0) cout << ans;
                        else cout << reverse(ans);
                        return 23;
                    }
                }
            }
        }
    }
    return 0;
}

int main()
{
    freopen("answer.in", "r", stdin);
    freopen("answer.out", "w", stdout);
    cin >> n;
    vector<string> nor, inv;
    for (size_t i = 0; i < n; i++)
    {
        string s;
        cin >> s;
        nor.push_back(s);
        inv.push_back(reverse(s));
    }
    if (solve(nor, inv, 0) == 23) return 0;
    if (solve(inv, nor, 1) == 23) return 0;
    cout << "Sorry, but I don't know question!\n";
}