#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int M = 2e6 + 5;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long expo(long long base, long long pow) {
  long long ans = 1;
  if (pow < 0) return 0;
  while (pow != 0) {
    if (pow & 1 == 1) {
      ans = ans * base;
      ans = ans % mod;
    }
    base *= base;
    base %= mod;
    pow /= 2;
  }
  return ans;
}
long long inv(long long x) { return expo(x, mod - 2); }
long long mult_mod(long long a, long long b) {
  a = a % mod;
  b = b % mod;
  long long c = (a * b) % mod;
  return c;
}
long long add_mod(long long a, long long b) {
  a = (a + mod) % mod;
  b = (b + mod) % mod;
  long long c = (a + b) % mod;
  return c;
}
long long fac[(int)(2e6 + 7)], inv_fac[(int)(2e6 + 7)];
void precomp_factorial() {
  fac[0] = 1;
  for (long long i = 1; i <= M; i++) fac[i] = mult_mod(i, fac[i - 1]);
  inv_fac[M] = inv(fac[M]);
  for (long long i = M - 1; i >= 0; i--)
    inv_fac[i] = mult_mod(i + 1, inv_fac[i + 1]);
}
long long nCk(long long n, long long k) {
  long long ans = fac[n];
  ans = mult_mod(ans, inv_fac[n - k]);
  ans = mult_mod(ans, inv_fac[k]);
  return ans;
}
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const long long mod1 = 1e9 + 7;
int arr[1234];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  for (int i = 1; i <= n; i++) {
    set<int> se;
    se.insert(i);
    int u = i;
    while (1) {
      if (se.count(arr[u])) {
        cout << arr[u] << " ";
        break;
      } else {
        u = arr[u];
        se.insert(u);
      }
    }
  }
  return 0;
}
