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