#include <bits/stdc++.h>

using namespace std;

constexpr int mod = 1e9 + 7, base = 29;

void solve() {
    int n;
    cin >> n;
    vector<string> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    string s(n, ' ');
    for (int i = 0; i < n; ++i) {
        s[i] = a[i][0];
    }
    map<int, int> ind;
    for (int i = 0; i < n; ++i) {
        int hash_start = 0;
        for (int j = 0; j + 1 < n * 3; ++j) {
            hash_start = (hash_start * 1LL * base + a[i][j] - 'a' + 1) % mod;
        }
        ind[hash_start] = i;
    }
    cout << s << '\n';
    for (int i = 0; i < n; ++i) {
        int hash_finish = 0;
        for (int j = 1; j < n * 3; ++j) {
            hash_finish = (hash_finish * 1LL * base + a[i][j] - 'a' + 1) % mod;
        }
        cout << ind[hash_finish] + 1 << ' ';
    }
    cout << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}