#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod1 = 1e9 + 7;
const int mod2 = 1e9 + 9;
const LL mod = (LL)mod1 * mod2;
const int P = 474747;
const int N = 1 << 13;

LL add(LL a, LL b)
{
	return a + b < mod ? a + b : a + b - mod;
}

LL sub(LL a, LL b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}

__int128 mult(LL a, LL b)
{
	return (__int128)a * b % mod;
}

int n;
LL pw[N];

vector<LL> calcHash(const string& s)
{
	vector<LL> h(SZ(s) + 1);
	FOR(i, 0, SZ(s))
		h[i + 1] = add(h[i], mult(pw[i], s[i]));
	return h;
}

// [l, r)
LL getHash(const vector<LL>& h, int l, int r)
{
	return mult(sub(h[r], h[l]), pw[N - 1 - r]);
}

char getNextLetter(const string& s, const vector<LL>& h)
{
	LL last = getHash(h, SZ(s) - n, SZ(s));
	FOR(d, 1, n + 1)
	{
		if (getHash(h, SZ(s) - n - d, SZ(s) - d) == last)
		{
			return s[SZ(s) - d];
		}
	}
	assert(false);
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	pw[0] = 1;
	FOR(i, 1, N)
		pw[i] = mult(pw[i - 1], P);
	cin >> n;
	vector<string> a(n);
	for (string& ai : a)
		cin >> ai;
	vector<vector<LL>> h(n);
	map<LL, int> mp;
	VI q;
	FOR(i, 0, n)
	{
		if (a[i] != "?")
		{
			h[i] = calcHash(a[i]);
			mp[h[i].back()] = i;
		}
		else
			q.PB(i);
	}
	VI x(n, -1);
	function<void(int)> rec = [&](int i)
	{
		if (x[i] != -1)
			return;
		char c = getNextLetter(a[i], h[i]);
		string aj = a[i].substr(1, SZ(a[i]) - 1) + c;
		vector<LL> hj = calcHash(aj);
		if (mp.count(hj.back()))
			x[i] = mp[hj.back()];
		else
		{
			assert(!q.empty());
			x[i] = q.back();
			q.pop_back();
			a[x[i]] = aj;
			h[x[i]] = hj;
			mp[hj.back()] = x[i];
		}
		rec(x[i]);
	};
	FOR(i, 0, n)
	{
		if (a[i] != "?")
		{
			rec(i);
		}
	}
	FOR(i, 0, n)
	{
		assert((x[i] == -1) == (a[i] == "?"));
	}
	FOR(i, 0, n)
	{
		cout << (a[i] == "?" ? 'a' : a[i][0]);
	}
	cout << "\n";
	FOR(i, 0, n)
	{
		cout << (x[i] == -1 ? i : x[i]) + 1 << " ";
	}
	cout << "\n";
	
	return 0;
}