//#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;
	}
};

ll binpow(ll a, ll b) {
	return (b == 0 ? 1 : square(binpow(a, b / 2)) % MOD * (b % 2 ? a : 1) % MOD);
}

ll inv(ll x) {
	return binpow(x, MOD - 2);
}

void solve() {
	ll n;
	cin >> n;
	vector<string> as(n);
	string ans(n, 'a');
	vector<ll> q;
	vector<ll> ps(1, 1);
	for (ll i = 0; i < n * 3; i++) {
		ps.push_back(ps.back() * P % MOD);
	}
	ll ip = inv(P);
	unordered_map<ll, ll> um;
	vector<pair<ll, ll>> hp;
	vector<ll> ld(n, n * 3);
	vector<ll> to(n, -1);
	for (ll i = 0; i < n; i++) {
		cin >> as[i];
		if (as[i] == "?") {
			q.push_back(i);
			to[i] = i;
			continue;
		}
		ans[i] = as[i][0];
		ll h = 0;
		for (auto j : as[i]) {
			h = (h * P + (j - 'a' + 1)) % MOD;
		}
		um[h] = i;
		hp.emplace_back(h, i);
	}
	ll otr = 0;
	while (!hp.empty()) {
		ps.pop_back();
		otr++;
		unordered_map<ll, ll> num;
		for (auto[h, i] : um) {
			ld[i]--;
			ll nh = (h - (as[i][ld[i]] - 'a' + 1) + MOD) % MOD * ip % MOD;
			num[nh] = i;
		}
		swap(um, num);
		vector<pair<ll, ll>> nhp;
		for (auto[h, i] : hp) {
			h = (h - (ps.back() * (as[i][otr - 1] - 'a' + 1) % MOD) + MOD) % MOD;
			if (um.find(h) != um.end()) {
				to[i] = um[h];
			} else {
				um[h] = q.back();
				as[q.back()] = as[i];
				to[i] = q.back();
				ans[q.back()] = as[i][otr];
				i = q.back();
				q.pop_back();
				nhp.emplace_back(h, i);
			}
		}
		swap(hp, nhp);
	}
	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();
	}
}