#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
#define _rep(i_,a_,b_) for(int i_ = (a_); i_ <= (b_); ++i_)
#define mid ((L+R) >> 1)
#define multiCase() int testCnt = in(); _rep(curCase,1,testCnt)
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
using ll = long long;
using pii = pair<int,int>;

int in(void) { int x; cin >> x; return x; } ll inl(void) { ll x; scanf("%lld", &x); return x; }
void out(int x) { printf("%d ", x); } void outln(int x) { printf("%d\n", x); }
void out(ll x) { printf("%lld ", x); } void outln(ll x) { printf("%lld\n", x); }
template<typename T> void chkmax(T &a, const T &b) { a = max(a, b); } 
template<typename T> void chkmin(T &a, const T &b) { a = min(a, b); } 
const int kN = 150;
mt19937 umi(830);
vector<string> a[kN];
vector<int> ord[kN];
int pt[kN], per[kN];

vector<string> ans; int anssum = numeric_limits<int>::max();
void update(const vector<string> &cur) {
	int sum = 0; for(auto &x : cur) sum += x.length();
	if(sum < anssum) ans = cur, anssum = sum;
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	int n = in(); cin.get();
	_rep(i,1,n) {
		pt[i] = i;
		string s, t; getline(cin, s);
		istringstream ss(s);
		while(ss >> t) a[i].emplace_back(t);
	}
	_rep(i,1,n) {
		assert(a[i].size() > 0);
		_rep(j,0,a[i].size() - 1) ord[i].emplace_back(j);
	}
	_rep(T,1,1000) {
		shuffle(pt + 1, pt + 1 + n, umi);
		unordered_set<string> s;
		vector<string> tmp(n);
		bool nosol = 0;
		_rep(_,1,n) { int i = pt[_];
			_rep(j,0,a[i].size() - 1) per[j] = 1;
			shuffle(ord[i].begin(), ord[i].end(), umi);
			auto Query = [&]() {
				string cur;
				_rep(j,0,a[i].size() - 1) cur += a[i][j].substr(0, per[j]);
				return s.count(cur);
			};
			while(Query()) {
				bool fnd = 0;
				for(auto &id : ord[i]) if(per[id] < a[i][id].length()) {
					++per[id];
					if(!Query()) { fnd = 1; break; }
				}
				if(fnd) continue;
				for(auto &id : ord[i]) if(per[id] < a[i][id].length()) { ++per[id], fnd = 1; break; }
				if(fnd) continue; else { nosol = 1; break; }
			}
			if(nosol) break;
			string cur; 
			_rep(j,0,a[i].size() - 1) cur += a[i][j].substr(0, per[j]);
			tmp[i - 1] = cur, s.insert(cur);
		}
		if(!nosol) update(tmp);
	}
	_rep(T,1,1000) {
		shuffle(pt + 1, pt + 1 + n, umi);
		unordered_set<string> s;
		vector<string> tmp(n);
		bool nosol = 0;
		_rep(_,1,n) { int i = pt[_]; 
			_rep(j,0,a[i].size() - 1) per[j] = 1;
			shuffle(ord[i].begin(), ord[i].end(), umi);
			auto Query = [&]() {
				string cur;
				_rep(j,0,a[i].size() - 1) cur += a[i][j].substr(0, per[j]);
				return s.count(cur);
			};
			while(Query()) {
				bool fnd = 0;
				for(auto &id : ord[i]) if(per[id] < a[i][id].length()) { ++per[id], fnd = 1; break; }
				if(!fnd) { nosol = 1; break; }
			}
			if(nosol) break;
			string cur; 
			_rep(j,0,a[i].size() - 1) cur += a[i][j].substr(0, per[j]);
			tmp[i - 1] = cur, s.insert(cur);
		}
		if(!nosol) update(tmp);
	}
	if(anssum == numeric_limits<int>::max()) puts("no solution");
	else for(auto &s : ans) cout << s << endl;
	return 0;
}