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



int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	
	int n;
	cin >> n;
	string ans(n, 'a');
	VI to(n);
	iota(ALL(to), 0);
	
	vector<string> inp(n);
	
	map<string, vector<pair<string, int>>> mp;
	
	VI freeV;
	FOR(i, 0, n)
	{
		string s;
		cin >> s;
		inp[i] = s;
		if(s == "?")
		{
			freeV.PB(i);
				continue;
		}
		ans[i] = s[0];
		
		int len = n;
		reverse(ALL(s));
		VI p = prefixFunction(s);
		reverse(ALL(s));
		FOR(j, n, 2 * n)
		{
			if(2 * p[j] < j + 1)
				continue;
			int cur = j + 1 - p[j];
			if((j + 1) % cur == 0)
			{
				len = cur;
				break;
			}
		}
		string c = s.substr(SZ(s) - len, len);
		int shift = minimalCyclicShift(c);
		
		if(shift != 0)
			c = c.substr(shift, SZ(c) - shift) + c.substr(0, shift);
		
		string go = "";
		
		int pos = 3 * n - len + shift;
		while(true)
		{
			if(pos - len < 0)
				break;
			if(s.substr(pos - len, len) == c)
			{
				pos -= len;
				continue;
			}
			break;
		}
		if(pos != 0)
			go = s.substr(0, pos);
		
		
		//cerr << c << " " << go << "\n";
		
		mp[c].PB(MP(go, i));
	}
	for(auto [c, vi] : mp)
	{
		vector<VI> cands(SZ(c));
		
		vector<pair<string, int>> trash;
		for(auto [d, v] : vi)
		{
			if(SZ(d) > SZ(c) || (SZ(d) != 0 && c.substr(SZ(c) - SZ(d), SZ(d)) != d))
			{
				trash.PB({d, v});
				continue;
			}
			cands[(SZ(c) - SZ(d)) % SZ(c)].PB(v);
		}
		FOR(i, 0, SZ(cands))
		{
			if(cands[i].empty())
			{
				assert(!freeV.empty());

				cands[i].PB(freeV.back());
				ans[freeV.back()] = c[i];
				freeV.pop_back();
			}
		}
		FOR(i, 0, SZ(cands))
		{
			int nx = cands[(i + 1) % SZ(c)][0];
			FOR(j, 0, SZ(cands[i]))
				to[cands[i][j]] = nx;
		}
		sort(ALL(trash), [](const pair<string, int>& a, const pair<string, int>& b){return SZ(a.F) < SZ(b.F);});
		
		map<string, int> whichV;
		for(auto [s, v] : trash)
		{
			while(true)
			{
				ans[v] = s[0];
				if(SZ(s) == 1)
				{
					to[v] = cands[0][0];
					whichV[s] = v;
					break;
				}
				string s1 = s.substr(1, SZ(s) - 1);
				if(whichV.count(s1))
				{
					to[v] = whichV[s1];
					whichV[s] = v;
					break;
				}
				if(SZ(s1) <= SZ(c) && c.substr(SZ(c) - SZ(s1), SZ(s1)) == s1)
				{
					to[v] = cands[SZ(c) - SZ(s1)][0];
					whichV[s] = v;
					break;
				}
				whichV[s] = v;
				
				assert(!freeV.empty());
				to[v] = freeV.back();
				freeV.pop_back();
				
				
				s = s1;
				v = to[v];
			}
		}
	}
	while(SZ(freeV))
	{
		int v = freeV.back();
		freeV.pop_back();
		
		ans[v] = 'a';
		to[v] = v;
	}
	cout << ans << "\n";
	FOR(i, 0, n)
	{
		if(i)
			cout << " ";
		cout << to[i] + 1;
	}
	cout << "\n";

	
	FOR(i, 0, n)
	{
		assert('a' <= ans[i] && ans[i] <= 'z');
		assert(0 <= to[i] && to[i] < n);
		if(inp[i] == "?")
			continue;
		
		string cur = "";
		int v = i;
		FOR(j, 0, 3 * n)
		{
			cur += ans[v];
			v = to[v];
		}
		
		assert(cur == inp[i]);
	}
	
	return 0;
}