Problem L: Basic Modifications - Unique

上一题 正确率: $85.96\%$ 下一题
"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $456$ 正确数量 $392$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

Description

Unique For a sequence of integers A={a0,a1,...,an−1} which is sorted by ascending order, eliminate all equivalent elements.

Input

A sequence is given in the following format.

n 

a0 a1,...,an−1

Output

Print the sequence after eliminating equivalent elements in a line. Separate adjacency elements by a space character.

Sample Input复制

4
1 2 2 4

Sample Output复制

1 2 4

提示

1≤n≤100,000 

−1000,000,000≤ai≤1,000,000,000 

a0≤a1≤...≤an−1