#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> A[300005];
long long B[300005];
int main() {
  long long n;
  scanf("%lld", &n);
  for (long long i = 1; i <= n; ++i) {
    scanf("%lld", &A[i].first);
    A[i].second = i;
  }
  sort(A + 1, A + n + 1);
  long long val = 1;
  for (long long i = 1; i <= n; ++i) {
    val = max(val, A[i].first);
    B[A[i].second] = val;
    val++;
  }
  for (long long i = 1; i <= n; ++i) {
    printf("%lld ", B[i]);
  }
  printf("\n");
  return 0;
}
