#include <bits/stdc++.h>
using namespace std;
struct st {
  int r, id;
};
st ar[300010];
bool cmp(st a, st b) { return a.r < b.r; }
bool cmp1(st a, st b) { return a.id < b.id; }
int main() {
  int n, x;
  while (cin >> n) {
    for (int i = 0; i < n; ++i) {
      scanf("%d", &x);
      ar[i].r = x;
      ar[i].id = i;
    }
    sort(ar, ar + n, cmp);
    for (int i = 1; i < n; ++i) {
      if (ar[i].r <= ar[i - 1].r) ar[i].r = ar[i - 1].r + 1;
    }
    sort(ar, ar + n, cmp1);
    for (int i = 0; i < n; ++i) {
      if (!i)
        printf("%d", ar[i].r);
      else
        printf(" %d", ar[i].r);
    }
    cout << endl;
  }
  return 0;
}
