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

VI prefixFunction(const string& s)
{
	int n = SZ(s);
	VI p(n);
	p[0] = 0;
	FOR (i, 1, n)
	{
		int j = p[i - 1];
		while (j != 0 && s[i] != s[j])
			j = p[j - 1];
		if (s[i] == s[j]) j++;
		p[i] = j;
	}
	return p;
}

int minimalCyclicShift(string s)
{
	int n = SZ(s);
	s.resize(2 * n);
	FOR(i, 0, n)
		s[n + i] = s[i];

	int shift = 0;
	VI f(2 * n);
	FOR(i, 1, 2 * n)
	{
		int j = f[i - 1 - shift];
		while(j > 0 && s[shift + j] != s[i])
		{
			if(s[shift + j] > s[i])
				shift = i - j;
			j = f[j - 1];
		}
		if(j == 0 && s[shift] != s[i])
		{
			if(s[shift] > s[i])
				shift = i;
			f[i - shift] = 0;
		}
		else
		{
			j++;
			f[i - shift] = j;
		}
	}
	return shift;
}

pair<int, string> find(string s)
{
	reverse(ALL(s));
	int len = 1;
	VI p = prefixFunction(s);
	int n = SZ(s);
	FOR (i, 1, n)
	{
		if (p[i] * 2 >= i)
		{
			len = i;
		}
	}
	int x = len - p[len] + 1;
	string t = s.substr(0, x);
	reverse(ALL(t));
	int shift = minimalCyclicShift(t);
	t = t.substr(shift, SZ(t) - shift) + t.substr(0, shift);
	return {n - len - 1, t};
}

int findPos(string s, string t)
{
	s = s.substr(0, SZ(t));
	int n = SZ(t);
	s += '#';
	s += t + t;
	VI p = prefixFunction(s);
	FOR (i, 2 * n, SZ(p))
	{
		if (p[i] == n)
			return i - 2 * n;
	}
	assert(0);
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	vector<string> s(n);
	VI pre(n);
	map<string, int> m;
	vector<VI> vec;
	vector<VI> cycle;
	string ans(n, '?');
	VI q;
	VI p(n, -1);
	FOR (i, 0, n)
	{
		cin >> s[i];
		if (s[i] == "?")
		{
			q.PB(i);
			continue;
		}
		ans[i] = s[i][0];
		auto [l, cyc] = find(s[i]);
		if (!m.count(cyc))
		{
			m[cyc] = SZ(m);
			vec.PB(VI());
			cycle.PB(VI(SZ(cyc), -1));
		}
		int pos = -1;
		if (l == 0)
			pos = findPos(s[i], cyc);
		if (pos != -1 && cycle[m[cyc]][pos] == -1)
		{
			pre[i] = l;
			cycle[m[cyc]][pos] = i;
		}
		else
		{
			l = max(l, 1);
			pre[i] = l;
			vec[m[cyc]].PB(i);
			
		}
	}
	for (auto [cyc, idx] : m)
	{
		map<string, int> f;
		auto res = cycle[idx];
		
		FOR (j, 0, SZ(cyc))
		{
			if (res[j] == -1)
			{
				res[j] = q.back();
				ans[q.back()] = cyc[j];
				q.pop_back();
			}
		}
		FOR (j, 0, SZ(cyc))
		{
			//cerr << res[j] << '\n';
			int i = res[j];
			p[i] = res[(j + 1) % SZ(cyc)];
			f[s[i].substr(0, SZ(cyc))] = i;
		}	
		auto& v = vec[idx];
		if (v.empty())
			continue;
		sort(ALL(v), [&](int i, int j)
		{
			return pre[i] < pre[j];
		});
		VI ls(SZ(v));
		FOR (i, 0, SZ(v))
		{
			int j = v[i];
			ls[i] = pre[j] + SZ(cyc);
			f[s[j].substr(0, ls[i])] = j;
		}			
		
		FOR (i, 0, SZ(v))
		{
			int j = v[i];
			int l = ls[i];
			int x = 1;
			int k = j;
			while (!f.count(s[j].substr(x, l - x)))
			{
				p[k] = q.back();
				k = q.back();
				ans[q.back()] = s[j][x];
				x++;
				q.pop_back();
			}
			p[k] = f[s[j].substr(x, l - x)];
		}
	}
	for (auto i : q)
	{
		ans[i] = 'g';
		p[i] = i;
	}
	
	//FOR (i, 0, n)
	//{
	//	int j = i;
	//	string t = "";
	//	FOR (k, 0, 3 * n)
	//	{
	//		t += ans[j];
	//		j = p[j];
	//	}
	//	assert(t == s[i]);
	//}
	
	cout << ans << '\n';
	FOR (i, 0, n)
		cout << p[i] + 1 << ' ';
	cout << '\n';
	
	
	return 0;
}