#include <iostream>
#include <fstream>
#include <algorithm>    // std::sort

using namespace std;

int main(){

	freopen("schi.in", "r", stdin);
	freopen("schi.out", "w", stdout);

	int n;
	int v [30010];
	scanf("%i", &n);
	for (int i = 1; i <= n; i++) {
		int x;
		scanf("%i", &x);
		if (v[x] == 0)
			v[x] = i;
		else {
			int inloc = i;
			int aux = 0;
			for (int j = x + 1; j <= i; j++) {
				aux = v[j-1];
				v[j-1] = inloc;
				inloc = aux;
			}
			v[i] = inloc;
		}
	}

	for (int i = 1; i <= n; i++)
		printf("%i\n", v[i]);
	fclose(stdin);
	fclose(stdout);
	return 0;
}