#include <bits/stdc++.h>
using namespace std;
const int oo = INT_MAX;
bool s(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
  int n;
  cin >> n;
  long long l = -1;
  pair<int, int> x[n];
  for (int i = 0; i < n; i++) cin >> x[i].first, x[i].second = i;
  sort(x, x + n);
  for (int i = 0; i < n; i++) {
    if (l > x[i].first)
      x[i].first = l, l++;
    else
      l = x[i].first + 1;
  }
  sort(x, x + n, s);
  for (int i = 0; i < n; i++) cout << x[i].first << ' ';
  return 0;
}
