#include <bits/stdc++.h>
using namespace std;
int n, i, j, mx;
pair<int, int> a[500000];
int ans[500000];
int main() {
  cin >> n;
  for (i = 0; i < n; ++i) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a, a + n);
  mx = a[0].first - 1;
  for (i = 0; i < n; ++i) {
    ans[a[i].second] = max(mx, a[i].first);
    mx = ans[a[i].second] + 1;
  }
  for (i = 0; i < n; ++i) cout << ans[i] << " ";
  cin >> n;
  return 0;
}
