#include <bits/stdc++.h>
using namespace std;
struct node {
  int a, b;
} a[400000];
int n;
int ans[400000];
bool cmp(const node &x, const node &y) { return x.a < y.a; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].a);
    a[i].b = i;
  }
  sort(a + 1, a + n + 1, cmp);
  int now = 0;
  for (int i = 1; i <= n; i++) {
    if (now < a[i].a) now = a[i].a;
    ans[a[i].b] = now;
    now++;
  }
  for (int i = 1; i <= n - 1; i++) printf("%d ", ans[i]);
  printf("%d", ans[n]);
  return 0;
}
