#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);
	int shift = minimalCyclicShift(t);
	t = t.substr(shift, SZ(t) - shift) + t.substr(0, shift);
	return {n - len - 1, t};
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	vector<string> s(n);
	VI pre(n);
	map<string, VI> m;
	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]);
		pre[i] = l;
		m[cyc].PB(i);
	}
	for (auto [cyc, v] : m)
	{
		sort(ALL(v), [&](int i, int j)
		{
			return pre[i] < pre[j];
		});
		int len = pre[v.back()];
		int cnt = 0;
		while (cnt < SZ(v) && pre[v[cnt]] == 0)
			cnt++;
		int mx = (cnt + SZ(cyc) - 1) / SZ(cyc);
		
		map<pair<int, char>, VI> f;
		FOR (i, 0, SZ(v))
			f[{pre[v[i]], ans[v[i]]}].PB(v[i]);
		vector<VI> res(mx, VI(SZ(cyc)));
		FOR (i, 0, mx)
		{
			FOR (c, 0, SZ(cyc))
			{
				if (f.count({0, cyc[c]}))
				{
					int j = f[{0, cyc[c]}].back();
					f[{0, cyc[c]}].pop_back();
					if (f[{0, cyc[c]}].empty())
						f.erase({0, cyc[c]});
					res[i][c] = j;
				}
				else
				{
					assert(!q.empty());
					res[i][c] = q.back();
					ans[q.back()] = cyc[c];
					q.pop_back();
				}
			}
		}
		
		FOR (i, 0, mx)
			FOR (j, 0, SZ(cyc))
				p[res[i][j]] = res[i][(j + 1) % SZ(cyc)];
		
		FOR (i, 0, SZ(cyc))
			f[{0, cyc[i]}].PB(res[0][i]);
			
		vector<set<int>> let(len);
		FOR (i, cnt, SZ(v))
		{
			int j = v[i];
			let[pre[j] - 1].insert(s[j][1]);
		}	
		FOR (i, 0, len)
		{
			for (auto c : let[i])
			{
				if (!f.count({i, c}))
				{
					assert(i);
					f[{i, c}].PB(q.back());
					ans[q.back()] = c;
					q.pop_back();
				}
			}
		}
		FOR (i, cnt, SZ(v))
		{
			int j = v[i];
			p[j] = f[{pre[j] - 1, s[j][1]}].back();
			int k = p[j];
			int x = 1;
			while (p[k] == -1)
			{
				x++;
				p[k] = f[{pre[j] - x, s[j][x]}].back();
				k = p[k]; 
			}
		}
	}
	cout << ans << '\n';
	FOR (i, 0, n)
		cout << p[i] + 1 << ' ';
	cout << '\n';
	
	
	return 0;
}