#include <bits/stdc++.h>
using namespace std;
struct node {
  int p, id;
} a[300001];
bool cmp(node a, node b) { return a.p < b.p; }
bool comp(node a, node b) { return a.id < b.id; }
int main() {
  int i, n;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i].p;
    a[i].id = i;
  }
  sort(a + 1, a + n + 1, cmp);
  int Min = a[1].p;
  for (i = 1; i <= n; i++) {
    if (a[i].p <= Min) {
      a[i].p = Min++;
    } else
      Min = a[i].p + 1;
  }
  sort(a + 1, a + n + 1, comp);
  cout << a[1].p;
  for (i = 2; i <= n; i++) cout << " " << a[i].p;
}
