#include <bits/stdc++.h>
using namespace std;
int i, k, n, b[400009];
pair<int, int> a[400009];
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    scanf("%d", &k);
    a[i] = {k, i};
  }
  sort(a + 1, a + n + 1);
  for (i = 1; i <= n; i++)
    if (a[i - 1].first >= a[i].first) a[i].first = a[i - 1].first + 1;
  for (i = 1; i <= n; i++) b[a[i].second] = a[i].first;
  for (i = 1; i <= n; i++) printf("%d ", b[i]);
}
