Reshelving Packets :
Difficulty Level : Medium
Submissions : 169
Asked In :
Marks :100
: 1 | : 0
You are given N shelves ranging from 0 to n-1 name shelve ($$$shelve_i ,shelve_{i+1}.....shelve{n-1}$$$).
Range of shelves from 1 to 99 inclusive. Given them to the minimum value possible and return the array in the same order through
Input
The first line of each test case contains a single integer N ($$$1 \le N \le 1e5 $$$).
The next line contains the N integers separated by the space name shelve ($$$1 \le shelve_i \le 99$$$)
Output
For each test case print the array of integers that is the reshelve them to the minimum value possible
Examples
Input
4 1 12 4 12
Output
1 3 2 3
Input
4 1 2 6 5
Output
1 2 4 3
