#include <bits/stdc++.h>
using namespace std;
const long long int Mx = 1e9 + 10;
const int maxN = 3 * 1e5;
long long int n, tmp, a[maxN + 10], b[maxN + 10], now, ans[maxN + 10];
map<unsigned int, long long int> m;
inline bool cm(const long long int u, const long long int v) {
  return a[u] < a[v];
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) b[i] = i;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    m[a[i]]++;
  }
  sort(b, b + n, cm);
  now = 0;
  for (int i = 0; i < n; i++) {
    if (now < a[b[i]]) now = a[b[i]];
    ans[b[i]] = now;
    now++;
    m[a[b[i]]]--;
  }
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
