#K1751. Unique Sorted Participant IDs

    ID: 24584 Type: Default 1000ms 256MiB

Unique Sorted Participant IDs

Unique Sorted Participant IDs

You are given an integer n representing the number of participant IDs, followed by a list of n integers which represent the participant IDs. Your task is to remove any duplicate IDs and output the unique IDs in ascending order.

Input Format: The first line contains an integer n. The second line contains n space-separated integers.

Output Format: Print the unique sorted participant IDs in one line separated by a single space. If there are no IDs, print an empty line.

Note: Ensure that your solution reads from standard input and writes to standard output.

inputFormat

The first line contains an integer n representing the number of participant IDs.

The second line contains n space-separated integers denoting the IDs.

outputFormat

Output a single line containing the unique participant IDs in ascending order separated by spaces. If there are no IDs, output an empty line.

## sample
10
5 3 8 5 2 9 1 2 4 3
1 2 3 4 5 8 9