import java.util.Scanner;
import java.util.TreeMap;

public class Main{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		TreeMap<Integer, Integer> map = new TreeMap<>();

		int i;
		for(i = 0; i < n; i++) {
			map.put(scan.nextInt(), i + 1);
		}

		int cnt = 0;
		int len = map.size();
		for(int ans: map.values()) {
			cnt++;
			if(len > cnt)
				System.out.print(ans + " ");
			else
				System.out.println(ans);
		}

	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz