#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<pair<long long, long long> > v(n);
  for (int i = 0; i < n; ++i) {
    cin >> v[i].first;
    v[i].second = i;
  }
  sort(v.begin(), v.end());
  set<int> s;
  long long cur_min = 0;
  for (int i = 0; i < n; ++i) {
    if (v[i].first > cur_min)
      cur_min = v[i].first;
    else {
      v[i].first = cur_min + 1;
      ++cur_min;
    }
  }
  for (int i = 0; i < n; ++i) swap(v[i].first, v[i].second);
  sort(v.begin(), v.end());
  for (int i = 0; i < n; ++i) cout << v[i].second << " ";
}
