#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=(1<<14)+5,M=N*128+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+1;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,k;
int son[M][52],flag[M],cnt,fa[M];
char chr[M];
void clr(){
	for(int i=1;i<=cnt;i++) Me(son[i],0),fa[i]=0,chr[i]=0;
	cnt=1;
}
vector<int> S1[N],S2[N];
vector<int> S[N];
string w[N];
int id[N],vis[N],mch[N];
int dfs(int x){
	if(vis[x]) return 0;
	vis[x]=1;
	for(int i:S[x]){
		if(!mch[i]||dfs(mch[i])) return mch[i]=x,1;
	}
	return 0;
}
void Solve(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n;
	string c;getline(cin,c);
	auto trs1=[](char c){
		if('a'<=c&&c<='z') return c-'a';
		return 26+c-'A';
	};
	map<string,int> f;
	for(int i=1;i<=n;i++){
		string c;
		getline(cin,c);
		while(!c.empty()&&!isgraph(c.back())) c.pop_back();
		vector<string> A;
		for(int l=0,r;l<c.size();l=r+1){
			for(r=l;r<c.size()&&c[r]!=' ';r++);
			A.push_back(c.substr(l,r-l));
		}
		clr();
		for(int j=0;j<=256;j++) S1[j].clear();S1[0].push_back(1);
		for(string s:A){
			for(int h=0;h<=256;h++) S2[h]=S1[h],S1[h].clear();
			int cts=0;
			for(int h=0;h<=256&&cts<n;h++){
				for(int x=0;x<h&&cts<n;x++)if(h-x<=s.size()){
					for(int &y:S2[x])if(cts<n){
						int &v=son[y][trs1(s[h-x-1])];
						if(!v) v=++cnt,fa[v]=y,chr[v]=s[h-x-1];
						if(!flag[v]) flag[v]=1,S1[h].push_back(v),cts++;
						y=v; 
					}
				}
			}
			for(int h=0;h<=256;h++) for(int j:S1[h]) flag[j]=0;
		}
		for(int h=0;h<=256;h++) for(int j:S1[h]){
			string c;
			while(fa[j]){
				c+=chr[j];
				j=fa[j];
			}
			reverse(all(c));
			if(!f.count(c)) f[c]=++k,w[k]=c;
			S[f[c]].push_back(i);
		}
	}
	iota(id+1,id+k+1,1);
	sort(id+1,id+k+1,[](int x,int y){return w[x].size()<w[y].size();});
	int cnt=0;
	for(int i=1;i<=k;i++){
		Me(vis,0);
		cnt+=dfs(id[i]);
	}
	if(cnt^n){
		puts("no solution");
	}else{
		for(int i=1;i<=n;i++) cout<<w[mch[i]]<<'\n',gdb(mch[i]);
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}