**Mock CCC Contest 2 Problem 1 - Neat Pencils** Patrick just found the cure to COVID-19. He's very happy so he wants to mess up his row of neat pencils. Each pencil in his row has a certain length, and he wants you to give him a **different** ordering of his original pencils; or just print `none` if no different reordering exists. Besides their lengths, the pencils are identical. **Constraints:** `1 ≤ N ≤ 200000` The lengths of the pencils will not exceed one billion. *Note: the lengths of the pencils are not guaranteed to be unique or in sorted order.* **Input specification:** First line: one integer: the number of Patrick's pencils. Second line: the lengths of Patrick's row of pencils **Ouput specification:** *Any* distinct reordering of Patrick's pencils (on one line); OR `none` if no possible distinct reordering exists. **Sample input:** ``` 5 1 2 3 4 5 ``` **Sample output:** ``` 4 1 5 3 2 ```