#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > a;
int r[300010];
int main() {
  int n, m;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int aux;
    scanf("%d", &aux);
    a.push_back(make_pair(aux, i));
  }
  sort(a.begin(), a.end());
  m = 1;
  for (int i = 0; i < n; i++) {
    r[a[i].second] = max(a[i].first, m);
    m = max(a[i].first, m) + 1;
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", r[i]);
  }
  printf("\n");
  return 0;
}
