include <stdio.h>

include <stdlib.h>

int main()
{
int n;
scanf("%d", &n);
int* p = (int)malloc(n * sizeof(int));
for (int i = 0; i < n; i++)
{
scanf("%d", p + i);
}//数组创建完毕
for (int i = 0; i < n - 1; i++)
{
for (int j = 0; j < n - 1 - i; j++)
{
if (p[j] > p[j + 1])
{
int temp = p[j];
p[j] = p[j + 1];
p[j + 1] = temp;
}
}
}//冒泡排完序确保从小到大排列
for (int i = 0; i < n; i++)
{
int gel = p[i];
if (p[i] == 0)//说明已经被删除
continue; //直接跳过循环
else
for (int j = i + 1; j < n; j++)
{
if (p[j] == gel) //出现重复就判断为0
p[j] = 0;
}
}
//删除重复后得到的是一个从小到大有序排列的一个数组
int sum = 0;
for (int i = 0; i < n; i++)
{
if (p[i] != 0)
sum++;
}//求出来新数组的大小
int
arr = (int)malloc(sum * sizeof(int));
int j = 0;
for (int i = 0; i < n; i++)
{
if (
(p + i) != 0)
{
*(arr + j) = *(p+i);
j++;
}
}
for (int i = 0; i < sum; i++)
{
printf("%d", arr[i]);
}
return 0;
}