#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int siz = 3e5 + 5;
int n, m, a[siz], out[siz];
set<long long> s;
bool is_ok(long long num) {
  if (s.find(num) == s.end()) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  vector<pair<long long, long long> > v;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    v.push_back({x, i});
  }
  sort(v.begin(), v.end());
  int sofar = 0;
  for (int i = 0; i < v.size(); i++) {
    int cur = v[i].first, ind = v[i].second;
    if (cur > sofar) {
      sofar = cur;
      out[ind] = sofar;
    } else {
      out[ind] = ++sofar;
    }
  }
  for (long long i = 1; i <= n; i++) cout << out[i] << " ";
}
