Christmas Gift Draw

At the annual Christmas party every guest brings one gift and puts it under the tree. The $n$ guests are numbered from $1$ to $n$, and the gift a guest brought carries that guest's number.

When the party ends, the guests take turns drawing one lot from a bowl that holds the numbers $1$ through $n$. A guest then takes the gift whose number matches the lot drawn. Every guest brings exactly one gift and receives exactly one gift.

Each guest wants to know who ended up with the gift they brought. Build that list.

The first line has the number of guests $n$ ($n < 20000$).

The $k$-th of the next $n$ lines, that is line $k+1$ of the input, has the number of the gift drawn by guest $k$ ($1 \le k \le n$).

Print $n$ lines telling who received each guest's gift. The first line is the number of the guest who received the gift brought by guest $1$, the second line is the number of the guest who received the gift brought by guest $2$, and the remaining lines follow the same rule. Each line holds a single integer and ends with a newline.