uva156

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<vector>
#include<map>
using namespace std;
const int maxn=10010;
const int N=10;

map<string,int> cnt;
vector<string> words;

string repr(const string &s){
	
	string r=s;
	
	for(int i=0;i<r.size();i++)
	 r[i]=tolower(r[i]);
	
	return r;
}

int main(){

	string s;
	
	while(cin>>s){
		
		if(s[0]=='#') break;
		
		words.push_back(s);
		string r=repr(s);
		
		if(!cnt.count(r)) cnt[r]=0;
		cnt[r]++;
	}
	
	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;
}