#include <bits/stdc++.h>
using namespace std;
int n;
pair<long long, long long> p[300010];
inline void input() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> p[i].first;
    p[i].second = i;
  }
  sort(p, p + n);
  int cnt = p[0].first, o = 0;
  for (int i = 1; i < n; i++) {
    if (p[i].first == cnt) {
      o++;
      p[i].first += o;
    } else {
      if (p[i].first <= p[i - 1].first) p[i].first = p[i - 1].first + 1;
      cnt = p[i].first;
      o = 0;
    }
  }
  for (int i = 0; i < n; i++) swap(p[i].first, p[i].second);
  sort(p, p + n);
  for (int i = 0; i < n; i++) cout << p[i].second << " ";
}
int main() { input(); }
