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