#include <bits/stdc++.h>
using namespace std;
long long arr[3 * 100001];
long long res[3 * 100001];
map<long long, long long> M;
inline long long rec(long long n) {
  if (!M[n]) return n;
  return rec(M[n] + 1);
}
int main() {
  int i, j;
  int a, b;
  int n;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> arr[i];
  }
  for (i = 0; i < n; i++) {
    long long cn = arr[i];
    if (!M[cn]) {
      M[cn] = cn + 1;
      res[i] = cn + 1;
    } else {
      long long num = M[arr[i]];
      long long cn = arr[i];
      long long tmp = arr[i];
      vector<long long> V;
      V.clear();
      while (cn <= (tmp + 3 * 100000)) {
        long long mp = M[cn];
        if (!M[mp]) {
          V.push_back(mp);
          break;
        }
        V.push_back(cn);
        cn = mp;
      }
      int sz = V.size();
      for (j = 0; j < sz; j++) M[V[j]] = V[sz - 1] + 1;
      res[i] = V[sz - 1] + 1;
    }
  }
  for (i = 0; i < n; i++) cout << res[i] - 1 << " ";
  M.clear();
  return 0;
}
