#include <bits/stdc++.h>
using namespace std;
int n;
struct p {
  int a, num, u;
} s[3000000];
bool cmpa(p x, p y) { return x.a < y.a; }
bool cmpnum(p x, p y) { return x.num < y.num; }
int main() {
  int i, used = 0;
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) {
    scanf("%d", &s[i].a);
    s[i].num = i;
  }
  sort(s + 1, s + n + 1, cmpa);
  for (i = 1; i <= n; ++i) {
    if (used < s[i].a)
      used = s[i].a;
    else
      ++used;
    s[i].u = used;
  }
  sort(s + 1, s + n + 1, cmpnum);
  for (i = 1; i <= n; ++i) printf("%d ", s[i].u);
  return 0;
}
