#include <bits/stdc++.h>
using namespace std;
using namespace std;
long ans[100005] = {0};
using namespace std;
int n, x, b[300005];
pair<int, int> a[300005];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    a[i] = make_pair(x, i);
  }
  stable_sort(a + 1, a + n + 1);
  x = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i].first > x) {
      x = a[i].first;
      b[a[i].second] = x;
      x++;
    } else {
      b[a[i].second] = x;
      x++;
    }
  }
  for (int i = 1; i <= n; i++) cout << b[i] << " ";
  return 0;
}
