//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007, P = 57;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
bool assign_min(T& a, T b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
T square(T a) {
	return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
	ll operator() (pair<ll, ll> p) const {
		return ((__int128)p.first * MOD + p.second) % INF64;
	}
};

void solve() {
	ll n;
	cin >> n;
	vector<string> as(n);
	string ans(n, 'a');
	vector<ll> qs;
	vector<unordered_map<ll, ll>> num(n * 3 + 1);
	num[0][0] = 0;
	for (ll i = 0; i < n; i++) {
		cin >> as[i];
		if (as[i] == "?") {
			qs.push_back(i);
			continue;
		}
		ans[i] = as[i][0];
		ll h = 0;
		ll nl = 0;
		vector<ll> ps(1, 1);
		for (auto j : as[i]) {
			nl++;
			h = (h * P + (j - 'a' + 1)) % MOD;
			num[nl][h] = i;
			ps.push_back(ps.back() * P % MOD);
		}
	}
	vector<ll> to(n, -1);
	for (ll i = 0; i < n; i++) {
		if (as[i] == "?") {
			continue;
		}
		ll h = 0;
		vector<ll> ps(1, 1);
		for (auto j : as[i]) {
			h = (h * P + (j - 'a' + 1)) % MOD;
			ps.push_back(ps.back() * P % MOD);
		}
		ll nn = 0;
		ll ost = n * 3;
		ll nnum = i;
		while (true) {
			ps.pop_back();
			h = (h - ps.back() * (as[i][nn] - 'a' + 1) % MOD + MOD) % MOD;
			ost--;
			if (num[ost].find(h) != num[ost].end()) {
				break;
			}
			to[nnum] = qs.back();
			nn++;
			ans[qs.back()] = as[i][nn];
			nnum = qs.back();
			qs.pop_back();
		}
		to[nnum] = num[ost][h];
	}
	cout << ans << '\n';
	for (ll i = 0; i < n; i++) {
		cout << to[i] + 1 << ' ';
	}
	cout << '\n';
}

int main() {
	if (IS_FILE) {
		freopen("", "r", stdin);
		freopen("", "w", stdout);
	}
    	ios_base::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
	ll t = 1;
	if (IS_TEST_CASES) {
		cin >> t;
	}
	for (ll i = 0; i < t; i++) {
		solve();
	}
}