On a chessboard of N x times; There are N rooks in chess that do not attack each other, that is, there is exactly one rook on each vertical and each horizontal.
The chessboard is rotated 90° clockwise. Output the resulting set-up of rooks.
Input
The first line of the input contains an integer N, 1 ≤ N≤ 10
5 — board size. The next N lines contain one number each from 1 to N, namely, the i-th line contains the number a
i — number of the column in which the rook stands on the i-th column. In this problem, the horizontals are numbered from 1 to N from top to bottom, the verticals are numbered from 1 to N from left to right (see figure).
Imprint
The program should output N numbers — the placement of the rooks after the turn in the same format.
Examples
| # |
Input |
Output |
| 1 |
5
4
2
3
5
1 |
1
4
3
5
2 |
Remark
The example in the condition corresponds to the figures. Initially, the rooks stood in columns 4, 2, 3, 5, 1
when listing them line by line from top to bottom. After turning, the rooks are in columns 1, 4, 3, 5, 2.