#include <bits/stdc++.h>
using namespace std;
bool indexsort(const pair<int, int>& p1, const pair<int, int>& p2) {
  return p1.first < p2.first;
}
bool valuesort(const pair<int, int>& p1, const pair<int, int>& p2) {
  return p1.second < p2.second;
}
int main() {
  int n;
  cin >> n;
  int input;
  vector<pair<int, int> > myvector;
  for (int i = 1; i < n + 1; i++) {
    cin >> input;
    myvector.push_back(pair<int, int>(i, input));
  }
  sort(myvector.begin(), myvector.end(), valuesort);
  for (int j = 1; j < n; j++) {
    if (myvector[j].second <= myvector[j - 1].second) {
      myvector[j].second = myvector[j - 1].second + 1;
    }
  }
  sort(myvector.begin(), myvector.end(), indexsort);
  for (int i = 0; i < n; i++) {
    cout << myvector[i].second << " ";
  }
  return 0;
}
