#include <bits/stdc++.h>
using namespace std;

const int N=(2e5)+5;

struct Num
{
 int number;
 int pos;
 int index;
};

Num a[N];

bool Compare(Num p,Num q)
{
 return p.pos<q.pos;
}

int main()
{

ios::sync_with_stdio(false);
cin.tie(nullptr);

int n,i;
bool sw;

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

cin>>n;

 for(i=1;i<=n;i++)
 {
  cin>>a[i].number;
  a[i].pos=a[i].number-(i-1);
  a[i].index=i;
 }

sort(a+1,a+n+1,Compare);

 for(i=1;i<=n;i++)
  cout<<a[i].pos+(i-1)<<" ";

cout<<"\n";

return 0;
}