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