#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > vp;
vector<int> v1(300005);
int a[300005];
int main() {
  int n, x;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x;
    vp.push_back({x, i + 1});
  }
  sort(vp.begin(), vp.end());
  int ha = vp[0].first, costo = 1;
  for (int i = 1; i < n; i++) {
    if (vp[i].first == ha) {
      vp[i].first += costo;
      costo++;
    } else {
      if (vp[i - 1].first >= vp[i].first)
        vp[i].first += 1 + vp[i - 1].first - vp[i].first;
      ha = vp[i].first;
      costo = 1;
    }
  }
  for (int i = 0; i < n; i++) {
    a[vp[i].second - 1] += vp[i].first;
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
  return 0;
}
