#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, t;
  cin >> n;
  map<long long int, long long int> mp;
  vector<pair<long long int, long long int> > a, ans;
  for (int i = 0; i < n; i++) {
    cin >> t;
    a.push_back({t, i});
  }
  a.push_back({1e9 + 5, 1e9 + 5});
  sort(a.begin(), a.end());
  for (int i = 0; i < n; i++) {
    while (mp[a[i].first] != 0) {
      a[i].first++;
    }
    mp[a[i].first] = 1;
    a[i + 1].first = max(a[i + 1].first, a[i].first + 1);
    ans.push_back({a[i].second, a[i].first});
  }
  sort(ans.begin(), ans.end());
  for (int i = 0; i < n; i++) cout << ans[i].second << " ";
}
