#include <bits/stdc++.h>
using namespace std;
struct sort_pred {
  bool operator()(const pair<int, int> &left, const pair<int, int> &right) {
    return ((left.second < right.second));
  }
};
int main() {
  int n, i, x = 0;
  cin >> n;
  pair<long long int, int> numbers[n];
  for (i = 0; i < n; i++) {
    cin >> numbers[i].first;
    numbers[i].second = i;
  }
  sort(numbers, numbers + n);
  for (i = 1; i < n; i++) {
    if (numbers[i].first <= numbers[i - 1].first) {
      numbers[i].first += (numbers[i - 1].first - numbers[i].first) + 1;
    }
  }
  sort(numbers, numbers + n, sort_pred());
  for (i = 0; i < n; i++) printf("%d ", numbers[i]);
  cout << endl;
  return 0;
}
