#include <bits/stdc++.h>
using namespace std;
int n;
struct yapi {
  int x, ind;
} ar[323123];
bool cmp1(yapi a, yapi b) { return a.x < b.x; }
bool cmp2(yapi a, yapi b) { return a.ind < b.ind; }
int main() {
  scanf(" %d", &n);
  for (int i = 0; i < n; i++) {
    scanf(" %d", &ar[i].x);
    ar[i].ind = i;
  }
  sort(ar, ar + n, cmp1);
  for (int i = 0; i < n; i++) {
    if (i && ar[i].x <= ar[i - 1].x) ar[i].x = ar[i - 1].x + 1;
  }
  sort(ar, ar + n, cmp2);
  for (int i = 0; i < n; i++) {
    printf("%d ", ar[i].x);
  }
  return 0;
}
