///Enta etfsh5t nseet el rank

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
        tree_order_statistics_node_update>;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
//#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ull = unsigned long long;
using uint = uint32_t;
using ii = pair<int, int>;

const int N = 1e5 + 20, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);

const long double EPS = 1e-9;

string s[1005];
vector<int> adj[256];
string toAssign;
int col[256];
int cnt[3];

void bt(int index) {
    if (index == toAssign.size()) {
        string s[3];
        f(i, 0, 18)s[col[toAssign[i]]].push_back(toAssign[i]);
        cout << s[0] << ' ' << s[1] << ' ' << s[2] << endl;
        ::exit(0);
    }
    bool can[3] = {cnt[0] != 6, cnt[1] != 6, cnt[2] != 6};
    for (auto x: adj[toAssign[index]])
        if (col[x] != -1) {
            can[col[x]] = false;
        }

    f(i, 0, 3)if (can[i]) {
            col[toAssign[index]] = i;
            cnt[i] += 1;
            bt(index + 1);
            cnt[i] -= 1;
        }
    col[toAssign[index]] = -1;
}

void doWork() {
    ::memset(col, -1, sizeof col);

    int n;
    cin >> n;
    set<char> st;
    f(i, 0, n) {
        cin >> s[i];
        st.insert(s[i][0]);
        st.insert(s[i][1]);
        st.insert(s[i][2]);
    }
    if (st.size() > 18) {
        cout << "0\n";
    }
    f(i, 0, n) {
        if (s[i][0] == s[i][1] || s[i][0] == s[i][2] || s[i][1] == s[i][2]) {
            cout << "0\n";
            return;
        }
        f(j, 0, 3)f(k, 1, 3)adj[s[i][j]].push_back(s[i][k]),
                        adj[s[i][k]].push_back(s[i][j]);
    }

    for (char c: st)toAssign.push_back(c);
    for (char c = 'a'; c <= 'z' && toAssign.size() < 18; c++) {
        if (st.count(c))continue;
        toAssign.push_back(c);
    }
    bt(0);
    cout << "0\n";
}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--)
        doWork();
    return 0;
}