#include <bits/stdc++.h>
using namespace std;
class po {
 public:
  int id, ranks;
};
bool cmp1(po p1, po p2) { return p1.id < p2.id; }
bool cmp2(po p1, po p2) { return p1.ranks < p2.ranks; }
po p[312345];
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    for (int i = 0; i < n; i++) scanf("%d", &p[i].ranks), p[i].id = i;
    sort(p, p + n, cmp2);
    int mrank = 1;
    for (int i = 0; i < n; i++) {
      if (p[i].ranks <= mrank) {
        p[i].ranks = mrank;
        mrank++;
      } else {
        mrank = p[i].ranks + 1;
      }
    }
    sort(p, p + n, cmp1);
    for (int i = 0; i < n; i++)
      printf("%d%c", p[i].ranks, (i == n - 1 ? '\n' : ' '));
  }
  return 0;
}
