#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[300005];
bool cmp(pair<int, int> p1, pair<int, int> p2) { return p1.second < p2.second; }
int main() {
  int n;
  while (cin >> n) {
    for (int i = 0; i < n; ++i) {
      scanf("%d", &a[i].first);
      a[i].second = i;
    }
    sort(a, a + n);
    for (int i = 1; i < n; ++i) {
      if (a[i].first <= a[i - 1].first) a[i].first = a[i - 1].first + 1;
    }
    sort(a, a + n, cmp);
    for (int i = 0; i < n; ++i) printf("%d ", a[i].first);
    cout << endl;
  }
}
