#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.14159265358979323;
const long long mod1 = 1e9 + 7;
const long long mod2 = 1e18;
const long long mod3 = 9e18;
const long long N = 1e9 + 7;
long long power(long long x, long long n) {
  if (n == 0) return 1;
  long long temp = power(x, n / 2);
  if (n % 2 == 0)
    return temp * temp;
  else
    return x * temp * temp;
}
long long gcd(long long a, long long b) {
  if (a < b) return gcd(b, a);
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / (gcd(a, b)); }
void swap(int* a, int* b) {
  int t = *a;
  *a = *b;
  *b = t;
}
bool f(long long x, long long y) { return x > y; }
bool cmp(long long x, long long y) { return abs(x) < abs(y); }
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long x, long long y) { return x > y ? y : x; }
long long ow(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b /= 2;
    a = (a * a) % mod;
  }
  return ans;
}
long long sum(vector<long long> v) {
  long long sm = 0;
  for (long long i = 0; 0 < v.size() ? i < v.size() : i > v.size();
       0 < v.size() ? i += 1 : i -= 1)
    sm = sm + v[i];
  return sm;
}
bool isGreater(long long i, long long j) { return (i > j); }
int main() {
  long long n;
  cin >> n;
  vector<long long> v(n + 1);
  for (long long i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1;
       1 < n + 1 ? i += 1 : i -= 1)
    cin >> v[i];
  vector<long long> ans(n + 1);
  for (long long i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1;
       1 < n + 1 ? i += 1 : i -= 1) {
    ans[v[i]] = i;
  }
  for (long long i = 1; 1 < n + 1 ? i < n + 1 : i > n + 1;
       1 < n + 1 ? i += 1 : i -= 1)
    cout << ans[i] << " ";
  return 0;
}
