#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];
    }
    unordered_map<int, int> ind;
    vector<vector<int>> pr_hash(n);
    vector<int> pw(n * 3 + 1);
    pw[0] = 1;
    for (int i = 1; i <= n * 3; ++i) {
        pw[i] = pw[i - 1] * 1LL * base % mod;
    }
    set<int> free;
    for (int i = 0; i < n; ++i) {
        if (a[i] == "?") {
            free.insert(i);
            continue;
        }
        pr_hash[i].assign(a[i].size() + 1, 0);
        for (int j = 0; j < n * 3; ++j) {
            pr_hash[i][j + 1] = (pr_hash[i][j] * 1LL * base + a[i][j] - 'a' + 1) % mod;
            ind[pr_hash[i][j + 1]] = i;
        }
    }
    vector<int> nxt(n, -1);
    queue<int> q;
    for (int i = 0; i < n; ++i) {
        if (a[i] != "?") {
            q.push(i);
        }
    }
    while (!q.empty()) {
        int i = q.front();
        q.pop();
        int suff_hash = (pr_hash[i].back() - pr_hash[i][1] * 1LL * pw[(int)a[i].size() - 1]) % mod;
        if (suff_hash < 0) {
            suff_hash += mod;
        }
        if (ind.count(suff_hash)) {
            nxt[i] = ind[suff_hash];
            continue;
        }
        int j = *free.begin();
        free.erase(j);
        a[j] = a[i].substr(1);
        s[j] = a[j][0];
        nxt[i] = j;
        pr_hash[j].assign(a[j].size() + 1, 0);
        for (int k = 0; k < (int)a[j].size(); ++k) {
            pr_hash[j][k + 1] = (pr_hash[j][k] * 1LL * base + a[j][k] - 'a' + 1) % mod;
            ind[pr_hash[j][k + 1]] = j;
        }
        q.push(j);
    }
    for (auto ind : free) {
        s[ind] = 'a';
        nxt[ind] = ind;
    }
    cout << s << '\n';
    for (int i = 0; i < n; ++i) {
        cout << nxt[i] + 1 << ' ';
    }
    cout << '\n';
}

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