#include <bits/extc++.h>

using namespace std;

constexpr int maxk = 26;

struct Node {
    int ind;
    array<int, maxk> nxt;

    Node() {
        ind = -1;
        nxt.fill(-1);
    }
};

vector<Node> trie;

void add_string(string s, int ind) {
    int nw = 0;
    for (auto ch : s) {
        if (trie[nw].nxt[ch - 'a'] == -1) {
            trie[nw].nxt[ch - 'a'] = trie.size();
            trie.emplace_back();
        }
        nw = trie[nw].nxt[ch - 'a'];
        trie[nw].ind = ind;
    }
}

int get_val(string s) {
    int nw = 0;
    for (auto ch : s) {
        if (trie[nw].nxt[ch - 'a'] == -1) {
            return -1;
        }
        nw = trie[nw].nxt[ch - 'a'];
    }
    return trie[nw].ind;
}

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];
    }
    trie.emplace_back();
    set<int> free;
    for (int i = 0; i < n; ++i) {
        if (a[i] == "?") {
            free.insert(i);
            continue;
        }
        add_string(a[i], 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 j = get_val(a[i].substr(1, n));
        if (j != -1) {
            nxt[i] = j;
            continue;
        }
        j = *free.begin();
        free.erase(j);
        a[j] = a[i].substr(1);
        s[j] = a[j][0];
        nxt[i] = j;
        add_string(a[j].substr(0, n), 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;
}