#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, i, j, k, p;
  cin >> n;
  vector<int> a(n), ans(n, -1);
  map<int, int> ct;
  unordered_set<int> s;
  vector<pair<int, int>> plist;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    if (ct[a[i]] == 0) {
      ct[a[i]]++;
      ans[i] = a[i];
      s.insert(a[i]);
    } else {
      plist.push_back({a[i], i});
    }
  }
  sort(plist.begin(), plist.end());
  p = 1;
  for (auto pp : plist) {
    while ((p < pp.first) || (s.find(p) != s.end())) p++;
    s.insert(p);
    ans[pp.second] = p;
  }
  for (i = 0; i < n; i++) cout << ans[i] << " ";
  cout << "\n";
  return 0;
}
