Secret Santa: Inverse Permutation

You are given a permutation that represents a gift exchange among employees. The permutation is defined such that the i-th number indicates the employee that employee i gives a gift to. In other words, if we denote this permutation as \( \pi \), then \( \pi(i) \) is the recipient of the gift from employee \( i \).

Your task is to compute the inverse permutation \( \pi^{-1} \) where \( \pi^{-1}(j) \) is the employee who gives a gift to employee \( j \). Mathematically, the inverse permutation satisfies \( \pi(\pi^{-1}(j)) = j \) for every \( j=1,2,\dots,n \).

For example, if the input permutation is [2, 3, 4, 5, 1] (which means employee 1 gives to 2, employee 2 gives to 3, and so on), then the inverse permutation is [5, 1, 2, 3, 4] because employee 5 gives to 1, employee 1 gives to 2, etc.

inputFormat

The first line contains a single integer \( n \) (the number of employees). The second line contains \( n \) space-separated integers representing the permutation \( \pi \), where the i-th integer indicates the recipient of the gift from employee \( i \).

outputFormat

Output a single line containing \( n \) space-separated integers, representing the inverse permutation \( \pi^{-1} \), where the i-th integer is the employee who gives a gift to employee \( i \).

5
2 3 4 5 1

5 1 2 3 4