Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Firstly, the number of numbers, N (1 <= N <= 100), is given
and then N of integers modulo less than 1000.
Put N numbers in increasing order.
|
Input
|
Output
|
5
3 1 2 4 2
|
1 2 2 3 4
|
Для отправки решений необходимо выполнить вход.
|