#include <bits/stdc++.h>
using namespace std;
int a[400100], b[400100], c[400100];
int i, n;
bool cmp(int i, int j) { return (a[i] < a[j]); }
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    c[i] = i;
  }
  sort(c + 1, c + n + 1, cmp);
  b[c[1]] = a[c[1]];
  for (int i = 2; i <= n; i++) {
    b[c[i]] = max(a[c[i]], b[c[i - 1]] + 1);
  }
  for (int i = 1; i <= n; i++) cout << b[i] << " ";
  return 0;
}
