#include <bits/stdc++.h>
using namespace std;
int a[300005];
int ans[300005];
vector<pair<int, int> > v;
int last = 0;
int n;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    v.push_back(make_pair(a[i], i));
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    if (v[i].first <= last) {
      ans[v[i].second] = last + 1;
      last++;
    } else {
      ans[v[i].second] = v[i].first;
      last = v[i].first;
    }
  }
  printf("%d", ans[0]);
  for (int i = 1; i < n; i++) printf(" %d", ans[i]);
  puts("");
  return 0;
}
