#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 3e5 + 35;
int n, sol[MAX_N];
pair<int, int> a[MAX_N];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a, a + n);
  int last = 0;
  for (int i = 0; i < n; i++) {
    if (a[i].first <= last) {
      a[i].first = last + 1;
    }
    last = a[i].first;
    sol[a[i].second] = a[i].first;
  }
  for (int i = 0; i < n; i++) {
    cout << sol[i] << " ";
  }
  return 0;
}
