#include<iostream>
using namespace std;
const int N=1e6+1e5+10;
int n;
int p[N];
int find(int x){
if(p[x] != x) p[x] = find(p[x]);
return p[x];
}
int main(){
scanf("%d",&n);
for(int i=1;i<N;i++) p[i] = i;
while(n--){
int x;
scanf("%d",&x);
x = find(x);
printf("%d ",x);
p[x] = x+1;
}
}