uva156

#include<iostream>
#include<string>
#include<cctype>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
map<string, int> cnt;
vector<string> words;
string repr(const string& s) {
	string ans = s;
	for (int i = 0; i < ans.length(); i++) {
		ans[i] = towlower(ans[i]);
	}
	sort(ans.begin(), ans.end());
	return ans;
}
int main() {
	int n = 0;
	string s;
	while (cin>>s)	{
		if (s[0] == '#')
			break;
		words.push_back(s);
		string r = repr(s);
		if (!cnt.count(r))//判断key是否存在
			cnt[r] = 0;
		cnt[r]++;//直接用key做下标访问第二个元素
	}
	vector<string> ans;
	for (int i = 0; i < words.size(); i++) {
		if (cnt[repr(words[i])] == 1)
			ans.push_back(words[i]);	
	}
	sort(ans.begin(), ans.end());
	for (int i = 0; i < ans.size(); i++)
		cout << ans[i] << endl;
	return 0;
}