#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
// 将字符串转换为字符集合的形式
string remove_similar_char(string str1){
set<char> s;
for(auto &c:str1)
s.insert(c);
string str2;
for(auto &c:s)
str2.push_back(c);
return str2;
}
// 顺序输出数组,其中最后一个不输出换行符
void print(vector<string> result){
for(auto &each:result){
if(each != result[result.size()-1])
cout << each << endl;
else
cout << each;
}
}
int main(){
int n;
cin >> n;
vector<string> result;
while(n--){
string str;
cin >> str;
string str2 = remove_similar_char(str);
// 判断字符集合是否已经存在,若不存在则存入数组
auto it = find(result.begin(),result.end(),str2);
if( it == result.end())
result.push_back(str2);
}
print(result);
return 0;
}