#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int N = 1010;


int main(){
    vector<int> q;
    int n = 0;
    scanf("%d",&n);
    for(int i = 0;i<n;i++){
        int x = 0;
        scanf("%d",&x);
        q.push_back(x);
    }
    sort(q.begin(),q.end());  //对q向量进行排序
    q.erase(unique(q.begin(),q.end()),q.end());  //重排q，然后去重

    for(int i = 0;i<q.size();i++){
        printf("%d\n",q[i]);
    }

    return 0;

}