#include <bits/stdc++.h>
using namespace std;
pair<int, int> arr[300005];
bool comp(const pair<int, int>& P1, const pair<int, int>& P2) {
  return P1.second < P2.second;
}
int main() {
  int n;
  cin >> n;
  int a;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a);
    arr[i] = {a, i};
  }
  sort(arr, arr + n);
  int last = -1;
  for (int i = 0; i < n; i++) {
    if (last < arr[i].first) {
      last = arr[i].first;
    } else {
      arr[i].first = last + 1;
      last++;
    }
  }
  sort(arr, arr + n, comp);
  for (int i = 0; i < n; i++) {
    cout << arr[i].first << " ";
  }
  return 0;
}
