UVA156

#include"iostream"
#include"algorithm"
#include"vector"
#include"map"
#include"string"
#include"deque"
#include"queue"
#include"stack"
#include"cstdio"
#include"ctype.h"
#include"cmath"
#include"set"
#include"sstream"
using namespace std;
map<string,int>a;
vector<string>word;
string repr(const string &s)
{
string ans =s;
for(int i=0;i<ans.length();i++)
if(ans[i]>='A'&&ans[i]<='Z') ans[i]+=32;
sort(ans.begin(),ans.end());
return ans;
}
int main()
{
//freopen("a.txt","r",stdin);
string s;
while(cin>>s)
{
if(s[0]=='#') break;
word.push_back (s);
string r=repr(s);
//cout<<r<<"----"<<endl;
if(!a.count(r)) a[r]=0;
a[r]++;
}
vector<string>ans;
for(int i=0;i<word.size();i++)
{
if(a[repr(word[i])]==1) ans.push_back(word[i]);
}
sort(ans.begin(),ans.end());
for(int i=0;i<ans.size();i++)
cout<<ans[i]<<endl;
return 0;
}