CF379C.New Year Ratings Change

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.

一个非常著名的互联网资源网站（我们称之为 X 站）推出了一项新年冒险活动。具体而言，他们决定为所有访问者评定等级。

该网站共有 $n$ 位用户，对于每位用户，我们已知其希望在新年礼物中获得的等级值。已知第 $i$ 位用户希望至少获得 $a_i$ 个等级单位作为礼物。

X 站由一群极具创造力且精打细算的管理员运营。一方面，他们希望所给出的等级互不相同；另一方面，礼物中所有等级的总和必须尽可能小。

请帮助 X 站完成这一富有挑战性的等级分配任务，找出最优的分配方案。

The first line contains integer n (1 ≤ n ≤ 3·105) — the number of users on the site. The next line contains integer sequence _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 109).

第一行包含一个整数 $n$（$1 \leq n \leq 3\cdot10^5$）—— 网站上的用户数量。
下一行包含一个整数序列 $a_1, a_2, ..., a_n$（$1 \leq a_i \leq 10^9$）。

Print a sequence of integers _b_1, _b_2, ..., 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.

输出一个整数序列 $b_1,\ b_2,\ \dots,\ b_n$。其中，数字 $b_i$ 表示用户 $i$ 将获得 $b_i$ 单位的评分为礼物。所输出的序列必须满足题目的所有条件。

若存在多个最优解，输出其中任意一个即可。