#include <bits/stdc++.h>
using namespace std;
inline void prep() {
  cin.tie(0);
  cin.sync_with_stdio(0);
};
const double pi = acos(-1.);
long long mod = 1000000007;
long long mymod(long long num) {
  if (num < 0 && !(num % mod == 0)) {
    if (mod == 1) {
      return 0;
    }
    return mod - abs(num) % mod;
  } else {
    return num % mod;
  }
}
const int biggg = 1000000000;
const double eps = .000000001;
int main() {
  prep();
  int n;
  cin >> n;
  pair<int, int> arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i].first;
    arr[i].second = i;
  }
  sort(arr, arr + n);
  int b[n];
  int curval = 0;
  for (int i = 0; i < n; i++) {
    curval = max(curval, arr[i].first);
    b[arr[i].second] = curval;
    curval++;
  }
  for (int i = 0; i < n; i++) {
    cout << b[i] << " ";
  }
  return 0;
}
