#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i;
  cin >> n;
  long int a[n], b[n];
  for (i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = i;
  }
  vector<pair<long int, long int> > V;
  vector<pair<long int, long int> > W;
  for (i = 0; i < n; i++) V.push_back(make_pair(a[i], b[i]));
  sort(V.begin(), V.end());
  for (i = 0; i < n; i++) {
    a[i] = V[i].first;
    b[i] = V[i].second;
  }
  for (i = 1; i < n; i++) {
    if (a[i] <= a[i - 1]) a[i] = a[i - 1] + 1;
  }
  for (i = 0; i < n; i++) W.push_back(make_pair(b[i], a[i]));
  sort(W.begin(), W.end());
  for (i = 0; i < n; i++) cout << W[i].second << " ";
  return 0;
}
