#include <bits/stdc++.h>
using namespace std;
long int n;
long int ans[511111];
long int cur;
pair<long int, long int> p[511111];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    p[i] = make_pair(x, i);
  }
  sort(p + 1, p + 1 + n);
  for (int i = 1; i <= n; i++) {
    if (p[i].first > cur) {
      ans[p[i].second] = p[i].first;
      cur = p[i].first + 1;
    } else if (p[i].first <= cur) {
      ans[p[i].second] = cur;
      cur++;
    }
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  return 0;
}
