#include <bits/stdc++.h>
using namespace std;
const int MAXN = 303030;
int N, ans[MAXN];
pair<int, int> vals[MAXN];
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    scanf("%d", &vals[i].first);
    vals[i].second = i;
  }
  sort(vals, vals + N);
  for (int i = 0; i < N; i++) {
    if (i > 0 && vals[i].first <= vals[i - 1].first) {
      vals[i].first = vals[i - 1].first + 1;
    }
    ans[vals[i].second] = vals[i].first;
  }
  for (int i = 0; i < N; i++) {
    printf("%d", ans[i]);
    if (i < N - 1) {
      printf(" ");
    } else {
      printf("\n");
    }
  }
  return 0;
}
