AT_abc408_b [ABC408B] Compression

An integer sequence $ A=(A_1,A_2,\ldots,A_N) $ of length $ N $ is given. Output the numbers contained in $ A $ in ascending order, removing duplicates.

The input is given from Standard Input in the following format: > $ N $ $ A_1 $ $ A_2 $ $ \ldots $ $ A_N $

Let $ C_1,C_2,\ldots , C_M $ be the numbers contained in $ A $ in ascending order. Output in the following format: > $ M $ $ C_1 $ $ C_2 $ $ \ldots $ $ C_M $

### Sample Explanation 1 The numbers contained in $ A=(3,1,4,1) $ are $ 1,3,4 $ in ascending order, totalling $ 3 $ distinct numbers. Therefore, output as shown above. ### Constraints - $ 1\le N\le 100 $ - $ 1\le A_i\le 100 $ - All input values are integers.