#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300100;
struct coso {
  long long val, ind, ans;
};
bool val(coso a, coso b) { return a.val < b.val; }
bool ind(coso a, coso b) { return a.ind < b.ind; }
long long n;
coso a[MAXN];
int main() {
  cin >> n;
  for (int i = 0; i < (int)(n); i++) {
    cin >> a[i].val;
    a[i].ind = i + 1;
  }
  sort(a, a + n, val);
  long long act = 0;
  for (int i = 0; i < (int)(n); i++) {
    a[i].ans = max(a[i].val, act);
    act = a[i].ans + 1;
  }
  sort(a, a + n, ind);
  for (int i = 0; i < (int)(n); i++) {
    if (i) cout << " ";
    cout << a[i].ans;
  }
  cout << endl;
  return 0;
}
