#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a;
  cin >> n;
  map<int, vector<int> > m;
  for (int i = 0; i < n; ++i) cin >> a, m[a].push_back(i);
  vector<int> ans(n);
  int v = m.begin()->first;
  for (map<int, vector<int> >::iterator i = m.begin(); i != m.end(); ++i) {
    v = max(v, i->first);
    while (i->second.size() > 1) {
      for (;; ++v)
        if (m.find(v) == m.end()) {
          m[v].push_back(i->second.back());
          break;
        }
      i->second.pop_back();
    }
    ans[i->second.back()] = i->first;
  }
  for (int i = 0; i < n; ++i) cout << ans[i] << " ";
  return 0;
}
