#include <bits/stdc++.h>
using namespace std;
int binarySearch(int arr[], int value, int n) {
  int left = 1, right = n;
  while (left <= right) {
    int middle = (left + right) / 2;
    if (arr[middle] == value)
      return middle;
    else if (arr[middle] > value)
      right = middle - 1;
    else
      left = middle + 1;
  }
  return -1;
}
int main() {
  int x[102], s[102], i, n, m;
  scanf("%d", &n);
  {
    for (i = 1; i <= n; i++) {
      scanf("%d", &m);
      s[m] = i;
    }
    for (i = 1; i < n; i++) printf("%d ", s[i]);
    printf("%d\n", s[n]);
  }
  return 0;
}
