#include <bits/stdc++.h>
using namespace std;
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());
  vector<pair<int, int>> b(n);
  for (int i = 1; i < n; i++)
    if (a[i].first <= a[i - 1].first) a[i].first = a[i - 1].first + 1;
  for (int i = 0; i < n; i++) {
    b[i].first = a[i].second;
    b[i].second = a[i].first;
  }
  sort(b.begin(), b.end());
  for (int i = 0; i < n; i++) cout << b[i].second << ' ';
  return 0;
}
