#include <bits/stdc++.h>
using namespace std;
typedef struct {
  int i;
  int x;
} KK;
KK a[1000000];
int b[1000000];
int cmp(KK x, KK y) { return x.x < y.x; }
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i].x);
      a[i].i = i;
    }
    sort(a, a + n, cmp);
    int minn = a[0].x;
    for (int i = 0; i < n; i++) {
      if (minn >= a[i].x) {
        b[a[i].i] = minn++;
      } else {
        minn = a[i].x;
        b[a[i].i] = minn++;
      }
    }
    for (int i = 0; i < n; i++) {
      if (i == 0)
        printf("%d", b[i]);
      else
        printf(" %d", b[i]);
    }
    printf("\n");
  }
  return 0;
}
