#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;

int n;
pair<int,int> nums[200111];

bool SS(pair<int,int> A, pair<int,int> B)
{
    return (A.first - A.second) < (B.first - B.second);
}

int main()
{
    freopen("shuffle.in", "r", stdin);
    freopen("shuffle.out", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int i,j;

    cin>>n;
    //scanf("%d",&n);

    for (i=1;i<=n;i++)
    {
        //scanf("%d",&nums[i].first);
        cin>>nums[i].first;
        nums[i].second = i;
    }

    sort(nums+1,nums+1+n,SS);

    for (i=1;i<=n;i++)
    {
        int shift = i - nums[i].second;
        cout<<nums[i].first+shift;

        if (i != n)
            cout<<" ";
    }
    cout<<endl;

    return 0;
}