#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int Find(int x) {
  if (mp.find(x) == mp.end()) return x;
  return mp[x] = Find(mp[x]);
}
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    mp.clear();
    int a;
    for (int i = 0; i < n; i++) {
      scanf("%d", &a);
      a = Find(a);
      mp[a] = a + 1;
      if (i) printf(" ");
      printf("%d", a);
    }
    printf("\n");
  }
  return 0;
}
