#include <bits/stdc++.h>
using namespace std;
int n, ans[1000000];
pair<int, int> val[1000000];
bool solve() {
  if (scanf("%d", &n) == EOF) return false;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &val[i]);
    val[i].second = i;
  }
  sort(val, val + n);
  int k = -1;
  for (int i = 0; i < n; ++i) {
    ans[val[i].second] = max(k, val[i].first);
    k = ans[val[i].second] + 1;
  }
  for (int i = 0; i < n; ++i) printf(i == n - 1 ? "%d\n" : "%d ", ans[i]);
  return true;
}
int main() {
  while (solve())
    ;
  return 0;
}
