#include <bits/stdc++.h>
using namespace std;
int n, a[(long long)(5 + 3e5)];
set<int> S, D;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++)
    scanf("%d", &a[i]), S.insert(a[i]), D.insert(a[i]);
  for (int i = 0; i < n; i++) {
    auto it = S.lower_bound(a[i]);
    printf("%d ", *it);
    if (D.count(*it + 1) == 0) S.insert(*it + 1);
    S.erase(it);
  }
  return 0;
}
