#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int N; 
    cin >> N;
    vector<int> vec(N);
    vector<int> ans;
    
    for(int i = 0; i < N; ++i)
      cin >> vec[i];
    
    sort(vec.begin(), vec.end());
    
    int last;
    for(int i = 0; i < N; ++i)
    {
        if(ans.size() == 0 || last != vec[i])
        {
            last = vec[i];
            ans.push_back(vec[i]);
        }
    }
    
    for(int i = 0; i < ans.size(); ++i)
      cout << (i == 0 ? "" : " ") << ans[i];
    cout << endl;
    
    return 0;
}
