#include <iostream>

#include <vector>

using namespace std;

void Rank(int add[],int n) //冒泡排序

{

    int i,j,num;

    for(i=;i<n-;i++){

        for(j=;j<=n-i-;j++){

            if(add[j]>add[j+])

            {

                num = add[j];

                add[j] = add[j+];

                add[j+] = num;

            }

        }

    }

}

int main()

{

    int n = ;

    int num[]={};

    while(scanf("%d",&n)!=EOF){

    int m = n;

    while(n>){

        n--;

        scanf("%d",&num[n]);

    }

    Rank(num,m);

    for(int i=;i<m;i++){

        if(num[i]!=num[i-])

            cout<<num[i]<<endl;

    }

}

    return ;

}