program p2040(Input,Output);
var
 n,i,j:longint;
 a,b,t:array[1..19999] of longint;
procedure qsort(l,r:longint);
var
 i,j,p,mid:longint;
begin
 i:=l; j:=r;
 mid:=a[(l+r) div 2];
 repeat
  while a[i]<mid do inc(i);
  while a[j]>mid do dec(j);
  if i<=j then
   begin
    p:=a[i]; a[i]:=a[j]; a[j]:=p;
    p:=t[i]; t[i]:=t[j]; t[j]:=p;
    inc(i); dec(j);
   end;
 until i>j;
 if l<j then qsort(l,j);
 if i<r then qsort(i,r);
end;
begin
while not eof do
begin
 readln(n);
 for i:=1 to n do
  begin
   read(a[i]); b[i]:=a[i]; t[i]:=i;
  end;
 qsort(1,n);
 for i:=1 to n do
  begin
   for j:=1 to n do
    if b[i]=a[j] then
     begin
      if i<n then
       write(j,' ')
      else
       writeln(j);
     end;
  end;
end;
end.
/**************************************************************
	Problem: 2218
	User: admin
	Language: Pascal
	Result: Wrong Answer
****************************************************************/