#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec;
for(int i = 0; i < n; i++){
int num;
cin >> num;
if(find(vec.begin(),vec.end(),num) == vec.end()){
vec.push_back(num);
}
sort(vec.begin(),vec.end());
}
for(int j = 0; j < vec.size(); j++){
cout << vec[j] << endl;
}
return 0;
}
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec;
for(int i = 0; i < n; i++){
int num;
cin >> num;
if(find(vec.begin(),vec.end(),num) == vec.end()){
vec.push_back(num);
}
sort(vec.begin(),vec.end());
}
for(int j = 0; j < vec.size(); j++){
cout << vec[j] << endl;
}
return 0;
}