#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int num,i=0,j=0,m=1;
int Array[1000];
while (cin >> num)
{
for (i = 0; i < num; i++)
{
cin >> Array[i];
}
sort(Array, Array + i, less<int>()); //排序
if (i == 1)
cout << Array[i - 1] << endl;
else {
cout << Array[0] << endl;
for (j = 1; j<i; ++j) {
if (Array[j] != Array[j - 1])
cout << Array[j] << endl;
}
}
}
system("pause");
return 0;
}
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int num,i=0,j=0,m=1;
while (cin >> num)
{
int Array[1000];
for (i = 0; i < num; i++)
{
cin >> Array[i];
}
sort(Array, Array + i, less<int>()); //排序
if (i == 1) cout << Array[0] << endl;
else
{
j=0;
while (j < i)
{
cout << Array[j] << endl;
m = 1;
if (j + m < i)
{
while (Array[j + m] == Array[j])
m++;
}
j = j + m;
}
}
}
system("pause");
return 0;
}