#include <bits/stdc++.h>
using namespace std;
struct Rate {
  int r;
  int id;
} rate[300005];
int num[300005];
bool cmp2(Rate R1, Rate R2) { return R1.r < R2.r; }
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      rate[i].id = i;
      scanf("%d", &rate[i].r);
    }
    sort(rate, rate + n, cmp2);
    int s = rate[0].r;
    for (int i = 0; i < n; i++)
      if (s >= rate[i].r)
        num[rate[i].id] = s++;
      else if (s < rate[i].r) {
        s = num[rate[i].id] = rate[i].r;
        s++;
      }
    printf("%d", num[0]);
    for (int i = 1; i < n; i++) printf(" %d", num[i]);
    puts("");
  }
  return 0;
}
