Good Bye 2013 C

C. New Year Ratings Change

time limit per test 1 second

memory limit per test 256 megabytes

 

One very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.

There are n users on the site, for each user we know the rating value he wants to get as a New Year Present. We know that user i wants to get at least a_i rating units as a present.

The X site is administered by very creative and thrifty people. On the one hand, they want to give distinct ratings and on the other hand, the total sum of the ratings in the present must be as small as possible.

Help site X cope with the challenging task of rating distribution. Find the optimal distribution.

Input

The first line contains integer n (1 ≤ n ≤ 3·10⁵) — the number of users on the site. The next line contains integer sequence a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹).

Output

Print a sequence of integers b₁, b₂, ..., b_n. Number b_i means that user i gets b_i of rating as a present. The printed sequence must meet the problem conditions.

If there are multiple optimal solutions, print any of them.

Sample test(s)

Input

3 
5 1 1

Output

5 1 2

Input

1 
1000000000

Output

1000000000

#pragma comment(linker,"/STACK:102400000,102400000")
#include <cstdio>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff
#define mod 1000000007
#define ll long long
#define maxn 300006
#define pi acos(-1.0)                                             
#define FF(i,n) for(int i=0;i<n;i++)
int n, m, s, z;
pair<ll,ll> a[maxn];
bool cmp(pair<ll, int>a, pair<ll, int> b){
    return a.second < b.second;
}
int main(){
    scanf("%d",&n);
    s = 0;
    for (int i = 0; i < n; i++){
        scanf("%I64d", &a[i].first);
        a[i].second = i;
    }
    sort(a, a + n);
    int j=0,l,r;
    ll m = 0, z = 0;
    for (int i = 0; i < n; i=j){
        while (j<n&&a[i].first == a[j].first)j++;
        l = i; r = j;
        z = max(0LL, m - a[l].first + 1);
        for (int k = l; k < r; k++){
            a[k].first += z;
            z++;
        }
        m = a[r - 1].first;
    }
    sort(a, a + n, cmp);
    for (int i = 0; i < n; i++)printf("%I64d ", a[i].first);
    return 0;
}