Presents · Interview Problem

Codeforces

Easy

Arrays

Presents

Given a permutation describing who gave a present to whom, reconstruct the final arrangement so that each child gets the present intended for them.

Acceptance 0%

Start Practice

Also Available On

Other platform versions and source mappings for the same problem.

Codeforces 136A

gfg

Problem Statement

Problem

There are $n$ children numbered from $1 $to$ n $. Each child gave a present to exactly one other child, and every child received exactly one present. The information is given as a permutation$ p $of length$ n $, where$ p_i $means the$ i $-th child gave their present to child$ p_i$.

Your task is to determine, for every child $i$ , which child gave a present to them.

In other words, output the inverse permutation.

Task

For each child $i$ from $1 $to$ n $, find the index$ j $such that$ p_j = i$.

Input Format

The first line contains an integer $n$ .
The second line contains $n$ integers $p_1, p_2, \dots, p_n$ — a permutation of $1..n$.

Output Format

Print $n$ integers $a_1, a_2, \dots, a_n$ where $a_i$ is the child who gave a present to child $i$ .

Constraints

$1 \le n \le 10^5$
$p$ is a permutation of $1..n$
Time limit friendly solution: $O(n)$

Examples

Sample cases returned by the problem API.

Example 1

Input

4
2 3 4 1

Output

4 1 2 3

Explanation

Child 1 received a present from child 4, child 2 from child 1, child 3 from child 2, and child 4 from child 3.

Premium problem context

Unlock deeper context for this problem

Premium adds guided hints, editorial links, similar variants, discussion resources, and concept maps so you can understand why a problem matters, not just solve it once.

Guided hints

Editorial and discussion links

Concept map and variants

Track your progress