#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
//#define int long long
int n,p[2010];
vector<int> vec;
char s[2010][6010];
bool chk(int i,int j){
	for(int k=1;k<3*n;k++)if(s[i][k]!=s[j][k-1])return 0;return 1;
}
void get(int i,int j){
	memcpy(s[i],s[j]+1,sizeof(s[i][0])*(3*n+2));
	for(int d=1;d<=n;d++){
		bool b=1;
		for(int k=n-1;k+d<3*n-1;k++)
			if(s[i][k]!=s[i][k+d]){b=0;break;}
		if(b){
			s[i][n*3-1]=s[i][n*3-1-d];return;
		}
	}
}
void find(int i){
	if(p[i])return;
	for(int j=1;j<=n&&!p[i];j++)
		if(s[j][0]!='?'&&chk(i,j))p[i]=j;
	if(!p[i])p[i]=vec.back(),vec.pop_back(),get(p[i],i);return find(p[i]);
}
void work(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s[i];if(s[i][0]=='?')vec.pb(i);
	}
	for(int i=1;i<=n;i++){
		if(!p[i]&&s[i][0]!='?')find(i);
	}
	for(int i=1;i<=n;i++){
		if(!p[i]&&s[i][0]=='?')s[i][0]='a',p[i]=i;
	}
	for(int i=1;i<=n;i++)cout<<s[i][0];cout<<'\n';
	for(int i=1;i<=n;i++)cout<<p[i]<<' ';cout<<'\n'; 
}
signed main(){
	ios::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
	int T=1;while(T--)work();return 0;
}