#include <fstream>
#include <cstdio>
#define MAX_SIZE 30001
#define left_son ((nod) << 1)
#define right_son ((nod) << 1) +1
using namespace std;


typedef struct
{
    int value;
    int pos;
}st;

st tree[3 * MAX_SIZE];
int vect[MAX_SIZE];

int A;
int B;
int val;

void build_tree(int nod , int left , int right)
{
    if (left == right)
    {
        tree[nod].value = vect[left];
        tree[nod].pos = left;
        return;
    }
    int middle = (left + right) >> 1;
    build_tree(left_son , left , middle);
    build_tree(right_son , middle+1 , right);
    if (tree[right_son].value <= tree[left_son].value)
    {
        tree[nod] = tree[right_son];
    }
    else
    {
        tree[nod] = tree[left_son];
    }
}

void update_tree(int nod , int left , int right)
{
    if (A > B) return;
    if (left == right)
    {
        tree[nod].value += val;
        return;
    }
    int middle = (left + right) >> 1;
    if (A <= middle) update_tree(left_son , left , middle);
    if (middle < B) update_tree(right_son ,middle+1,right);

    if (tree[right_son].value <= tree[left_son].value)
    {
        tree[nod] = tree[right_son];
    }
    else
    {
        tree[nod] = tree[left_son];
    }
}

int main()
{
    FILE *input = fopen("schi.in","r");
    FILE *output = fopen("schi.out","w");

    int N;
    fscanf(input , "%d" , &N);
    for (int i = 1;i<=N;i++)
    {
        fscanf(input , "%d" , &vect[i]);
    }
    build_tree(1,1,N);
    for (int i = 1 ; i<=N;i++)
    {
        fprintf(output , "%d\n" , tree[1].pos);
        A = 1;
        B = tree[1].pos - 1;
        val = 1;
        update_tree(1,1,N);

        A = tree[1].pos;
        B = tree[1].pos;
        val = MAX_SIZE;

        update_tree(1,1,N);

    }
    fclose(input);
    fclose(output);

    return 0;
}