#include <bits/stdc++.h>

using namespace std;
const int N = 1e3;
int p [N];
bool visited [N];

int DFS(int i)
{
    visited [i] = 1;
    if (!visited [p [i]])
        return DFS(p [i]);
    else
        return p [i];
}

int main()
{
    int n;
    cin >> n;
    int ans [n];
    for (int i = 0; i < n; i++)
    {
        cin >> p [i];
        p [i]--;
    }
    for (int i = 0; i < n; i++)
    {
        for (int i = 0; i < n; i++)
            visited [i] = 0;
        ans [i] = DFS(i);
    }
    for (int i = 0; i < n; i++)
        cout << ++ans [i] << " ";
}