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