import sys n = input() num1 = int(n) lst = [] for i in range(0,num1): number = int(input()) lst.append(number) # #方法1 # lst = set(lst) # lst = sorted(lst) # for i in lst: # print(i) #方法2 #去重 b = [] for i in lst: if i not in b: b.append(i) #冒泡排序 n = len(b) for i in range(0,n): for j in range(0,n-i-1): if b[j]>b[j+1]: (b[j],b[j+1]) = (b[j+1],b[j]) for i in b: print(i)