#include <bits/stdc++.h>
using namespace std;
struct ar {
  int val;
  int in;
  int c;
} a[6000 * 101];
bool f(ar x, ar y) { return x.val < y.val; }
bool f1(ar x, ar y) { return x.in < y.in; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i].val;
    a[i].in = i;
  }
  sort(a, a + n, f);
  int s = a[0].val;
  a[0].c = s;
  for (int i = 1; i < n; i++) {
    s = max(a[i].val, s + 1);
    a[i].c = s;
  }
  sort(a, a + n, f1);
  for (int i = 0; i < n; i++) cout << a[i].c << " ";
  return 0;
}
