#include <bits/stdc++.h>
using namespace std;
int n, x, cur;
vector<pair<int, int> > v;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    v.push_back(make_pair(x, i));
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    if (v[i].first < cur) {
      v[i].first = cur;
      cur++;
    } else
      cur = v[i].first + 1;
    swap(v[i].first, v[i].second);
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    printf("%d", v[i].second);
    if (i == n - 1)
      printf("\n");
    else
      printf(" ");
  }
}
