#include <bits/stdc++.h>
using namespace std;
const long long INF = 100000000000000000;
const long long MOD = 1000000007;
const long long MAXN = 100005;
long long dx[] = {0, 0, -1, 1, -1, -1, 1, 1};
long long dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
void solve() {
  long long n;
  cin >> n;
  long long a[n], ans[n];
  pair<long long, long long> b[n];
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    b[i].first = a[i];
    b[i].second = i;
  }
  sort(b, b + n);
  long long now = -1;
  for (int i = 0; i < n; ++i) {
    if (b[i].first > now) {
      now = b[i].first;
    }
    ans[b[i].second] = now;
    now += 1;
  }
  for (int i = 0; i < n; ++i) {
    cout << ans[i] << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
