#include <stdio.h>
/*
void Swap(int *a, int *b)
{
    int temp
    temp = a;
    a = b;
    b = temp;
    arr[a] = arr[b];
    arr[b] = temp;
}

void QuickSort(int arr[], int left, int right)
{
    int pl = left;
    int pr = right;
    int pivot = sizeof(arr)/sizeof(int)/2;

    do
    {
        if(arr[pl] > pivot && arr[pr] < pivot)
        {
            int temp = arr[pl];
            arr[pl] = arr[pr];
            arr[pr] = temp;
            pl++;
            pr++;
        }
    }while(pl < pr)
}
*/

typedef struct{
    int idx;
    int num;
}Data;

int compare(const void *a, const void *b){
    Data *A = (Data *)a;
    Data *B = (Data *)b;
    return (A->num - B->num); //양수= 오름차순, 음수=내림차순
}

int main() {
    int n;
    scanf("%d", &n);

    Data arr[n];
    int sam[n];

    for(int i=0; i<n; i++)
    {
        scanf("%d", &arr[i].num);
        arr[i].idx = i;
    }

    qsort(arr, sizeof(n)/sizeof(int), sizeof(Data), compare);

    for(int i=0; i<n; i++)
    {
        printf("arr: %d \n", arr[i].num);
    }

    for(int i=0; i<n; i++)
    {
        sam[arr[i].idx] = i;
    }

        for(int i=0; i<n; i++)
        {
            printf("%d", sam[i]);
        }

        
    return 0;
}