#include <bits/stdc++.h>
using namespace std;
long long n;
long long x[300001], y[300001];
long long cmp(long long i, long long j) { return x[i] < x[j]; }
int main() {
  cin >> n;
  for (long long i = 0; i < n; ++i) {
    cin >> x[i];
    y[i] = i;
  }
  sort(y, y + n, cmp);
  long long p = x[y[0]] + 1;
  for (long long i = 1; i < n; ++i) {
    if (x[y[i]] <= p) {
      x[y[i]] = p;
      p += 1;
    } else
      p = x[y[i]] + 1;
  }
  for (long long i = 0; i < n; ++i) cout << x[i] << " ";
  return 0;
}
