#include <bits/stdc++.h>
using namespace std;
struct st {
  int num;
  int id;
} a[300009];
int N;
inline bool cmp(st a, st b) { return a.num < b.num; }
inline bool idc(st a, st b) { return a.id < b.id; }
void Read() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    scanf("%d", &a[i].num);
    a[i].id = i;
  }
  sort(a + 1, a + N + 1, cmp);
}
void Solve() {
  for (int i = 2; i <= N; i++) {
    if (a[i].num <= a[i - 1].num) a[i].num = a[i - 1].num + 1;
  }
  sort(a + 1, a + N + 1, idc);
  for (int i = 1; i <= N; i++) printf("%d ", a[i].num);
}
int main() {
  Read();
  Solve();
  return 0;
}
