#include <bits/stdc++.h>
using namespace std;
struct dulieu {
  long int gt, tt;
};
long int n;
dulieu a[3 * 100005];
bool sx1(dulieu a, dulieu b) { return a.gt < b.gt; }
bool sx2(dulieu a, dulieu b) { return a.tt < b.tt; }
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i].gt;
    a[i].tt = i;
  }
  sort(a, a + n, sx1);
  for (int i = 0; i < n; i++)
    if (a[i].gt <= a[i - 1].gt) a[i].gt = a[i - 1].gt + 1;
  sort(a, a + n, sx2);
  for (int i = 0; i < n; i++) cout << a[i].gt << " ";
}
