import java.util.Scanner;

public class Solution {
    public static void main(String [] args) {
        /* Create function: p_inverse */
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int [] p_inverse = new int[n + 1];
        for (int x = 1; x <= n; x++) {
            int px = scan.nextInt();
            p_inverse[px] = x;
        }
        scan.close();
        
        /* Calculate and print each y */
        for (int x = 1; x <= n; x++) {
            int y = p_inverse[p_inverse[x]];
            System.out.println(y);
        }
    }
}

#include <iostream>

using namespace std;
int main() {
    int n;
    cin>>n;
    int p[n+1];
    for(int i=1;i<=n;i++){
        int k;
        cin>>k;
        p[k]=i;
    }
    for(int i=1;i<=n;i++)cout<<p[p[i]]<<endl;
    return 0;
}

n = int(input().strip())
p = list(map(int,input().strip().split(' ')))
for i in range(n):   
    print(p.index(p.index(i+1)+1)+1)

''' Our task is :: For each x from 1 to n , print an integer denoting any valid y satisfying the equation p(p(y)) = x on a new line.
Here p(y) means, the value at y index in list p. But the range of y goes from 1 to n, and range of python list goes from 0 to n-1. so make it balanced, we need to add 1 in each time in y to make it equal to python index.

for example
3
2 3 1

Now, x goes from 1 to 3 (inclusive), but since the range goes from 0 to n-1, 1 needed to add here to balance it.

when i = 0, x = i+1, you need to find that at which index 1 is coming in list p
first_index = p.index(i+1)
now, u need to find at which index the first_index is coming, but since , the index coming as output in above line is from 0 to  n-1, 1 needed to add to balace it

second_index = p.index(first_index+1)

since this will also be 0 to n-1,, add 1

ans = second_index + 1

I have written a new code so u can understand how each line works
'''

n = int(input().strip())
p = list(map(int,input().strip().split(' ')))
for i in range(n):    
    x = i+1
    first_index = p.index(x)
    second_index = p.index(first_index + 1)
    ans = second_index + 1
    print(ans)

int main() {
    int n;
    scanf("%d", &n);
    int p;
    int v[51];
    for(int i = 1; i <= n; i++) {
        scanf("%d", &p);
        v[p] = i;
    }
    for(int i = 1; i <= n; i++) {
        printf("%d\n", v[v[i]]);
    }
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

int main() {
    int n;
    scanf("%d", &n);
    int* a = (int*) malloc(sizeof(int)*n);
    int* b = (int*) malloc(sizeof(int)*n);
    for (int i = 0; i < n; i++) {
        scanf("%d", a+i);
        b[a[i]-1] = i+1;
    } 
    for (int i = 0; i < n; i++) printf("%d\n", b[b[i]-1]);
    return 0;
}

n = int(raw_input())
p_temp = map(int, raw_input().split())
p = {v: k+1 for k, v in enumerate(p_temp)}
for i in range(1, n+1):
    print p[p[i]]

static int[] permutationEquation(int[] p) {
	      int []sol=new int[p.length];
	        for(int i:p)  sol[p[p[i-1]-1]-1]=i;
	        return sol;
	    }

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;

namespace Solution {
class Solution {
    static void Main(string[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT */
        int t = Convert.ToInt32(Console.ReadLine());
        string[] str = Console.ReadLine().Split(' ');
        int[] arr = Array.ConvertAll(str, Int32.Parse);
        for(int i=1;i<=t;i++)
        {
            int index1 = Array.IndexOf(arr, i)+1;
            int index2 = Array.IndexOf(arr, index1)+1;
            Console.WriteLine(index2);
        }
    }
}
}

for(int x = 1; x <= n; x++){
        for(int y = 1; y <= n; y++){
            if(p[p[y]] == x)
            printf("%d\n",y);
        }
    }