#include <bits/stdc++.h>
using namespace std;
const int N = 3000 * 100 + 10;
int n;
long long a[N];
pair<long long, long long> b[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[i].first = a[i];
    b[i].second = i;
  }
  sort(b, b + n);
  for (int i = 1; i < n; i++)
    if (b[i].first <= b[i - 1].first) b[i].first = b[i - 1].first + 1;
  for (int i = 0; i < n; i++) swap(b[i].first, b[i].second);
  sort(b, b + n);
  for (int i = 0; i < n; i++) cout << b[i].second << " ";
  cout << '\n';
  return 0;
}
