#include <bits/stdc++.h>
using std::sort;
std::pair<int, int> all[300005];
inline bool cmp(std::pair<int, int> a, std::pair<int, int> b) {
  return a.second < b.second;
}
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; ++i) scanf("%d", &all[i].first), all[i].second = i;
    sort(all, all + n);
    for (int i = 1; i < n; ++i)
      if (all[i].first <= all[i - 1].first) all[i].first = all[i - 1].first + 1;
    sort(all, all + n, cmp);
    for (int i = 0; i < n - 1; ++i) printf("%d ", all[i].first);
    printf("%d\n", all[n - 1].first);
  }
}
