#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  pair<int, int> a[n];
  for (int i = 0; i < n; ++i) cin >> a[i].first, a[i].second = i;
  sort(a, a + n);
  int cur = a[0].first;
  for (int i = 1; i < n; ++i) {
    if (a[i].first == cur) {
      a[i].first = a[i - 1].first + 1;
    } else {
      cur = a[i].first;
      if (a[i].first <= a[i - 1].first) {
        a[i].first = a[i - 1].first + 1;
      }
    }
  }
  sort(a, a + n, [&](const pair<int, int> &l, const pair<int, int> &r) -> bool {
    return l.second < r.second;
  });
  for (int i = 0; i < n; ++i) cout << a[i].first << " ";
  return !cout << '\n';
}
