#include <bits/stdc++.h>

using namespace std;
using ll = long long;

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

    int n;
    cin >> n;

    auto restore = [&](string s) {
        auto init = s;
        s = s.substr(n);
        for (int len = 1; len <= n; ++len) {
            bool yay = true;
            for (int i = 0; i + len < s.size(); ++i) {
                if (s[i + len] != s[i]) {
                    yay = false;
                    break;
                }
            }
            if (yay) {
                init.push_back(init.end()[-len]);
                return init;
            }
        }
        assert(false);
    };

    vector<string> s(n);
    for (int i = 0; i < n; ++i) {
        cin >> s[i];
    }

    queue<int> q;
    for (int i = 0; i < n; ++i) {
        if (s[i].size() > 1) {
            q.push(i);
        }
    }
    auto check = [&](int i, int j) {
        if (s[i].substr(1) == s[j].substr(0, 3 * n - 1)) {
            return true;
        } else {
            return false;
        }
    };
    vector<int> que;
    for (int i = 0; i < n; ++i) {
        if (s[i].size() == 1) {
            que.push_back(i);
        }
    }
    vector<int> to(n, -1);
    while (!q.empty()) {
        int i = q.front();
        q.pop();
        for (int j = 0; j < n; ++j) {
            if (s[j].size() > 1 && check(i, j)) {
                to[i] = j;
                break;
            }
        }
        if (to[i] == -1) {
            assert(!que.empty());
            to[i] = que.back();
            que.pop_back();
            s[to[i]] = restore(s[i].substr(1));
            q.push(to[i]);
        }
    }

    for (int i = 0; i < n; ++i) {
        if (s[i].size() == 1) {
            to[i] = i;
            s[i] = string(3 * n, 'a');
        }
    }

    for (int i = 0; i < n; ++i) {
        cout << s[i][0];
    }
    cout << '\n';
    for (int i = 0; i < n; ++i) {
        cout << to[i] + 1 << " \n"[i == n - 1];
    }

    return 0;
}