#include <bits/stdc++.h>
using namespace std;
ifstream fin ("algsort.in");
ofstream fout ("algsort.out");
set <pair <int, int> > s;
set <pair <int, int> >:: iterator it;
pair <int, int> a;
int n;
int main (){
    fin >> n;
    for (int i = 0; i < n; i ++){
        fin >> a.first;
        a.second = i;
        s.insert (a);
    }
    for (it = s.begin (); it != s.end (); it ++)
        fout << (*it).first << " ";
    return 0;
}