#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 1;
int n, cur, ans[N];
pair<int, int> a[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i].first);
    a[i].second = i;
  }
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    cur = max(cur + 1, a[i].first);
    ans[a[i].second] = cur;
  }
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
}
