Inventory

题意翻译

给你一个长度为 $n$ 的数组 $a$，满足 $1\le a_i\le n$，要求以最小的修改次数，使其成为 $1$ 到 $n$ 的排列，输出修改后的数组（如果答案有多个，输出任意一个，每个数中间用空格隔开）。 $1\le n\le 10^5$ $1\le a_i\le 10^5$

题目描述

Companies always have a lot of equipment, furniture and other things. All of them should be tracked. To do this, there is an inventory number assigned with each item. It is much easier to create a database by using those numbers and keep the track of everything. During an audit, you were surprised to find out that the items are not numbered sequentially, and some items even share the same inventory number! There is an urgent need to fix it. You have chosen to make the numbers of the items sequential, starting with $ 1 $ . Changing a number is quite a time-consuming process, and you would like to make maximum use of the current numbering. You have been given information on current inventory numbers for $ n $ items in the company. Renumber items so that their inventory numbers form a permutation of numbers from $ 1 $ to $ n $ by changing the number of as few items as possible. Let us remind you that a set of $ n $ numbers forms a permutation if all the numbers are in the range from $ 1 $ to $ n $ , and no two numbers are equal.

输入输出格式

输入格式

The first line contains a single integer $ n $ — the number of items ( $ 1<=n<=10^{5} $ ). The second line contains $ n $ numbers $ a_{1},a_{2},...,a_{n} $ ( $ 1<=a_{i}<=10^{5} $ ) — the initial inventory numbers of the items.

输出格式

Print $ n $ numbers — the final inventory numbers of the items in the order they occur in the input. If there are multiple possible answers, you may print any of them.

输入输出样例

输入样例 #1

3
1 3 2

输出样例 #1

1 3 2 

输入样例 #2

4
2 2 3 3

输出样例 #2

2 1 3 4 

输入样例 #3

1
2

输出样例 #3

1 

说明

In the first test the numeration is already a permutation, so there is no need to change anything. In the second test there are two pairs of equal numbers, in each pair you need to replace one number. In the third test you need to replace $ 2 $ by $ 1 $ , as the numbering should start from one.

题意翻译

给你一个长度为 $n$ 的数组 $a$，满足 $1\le a_i\le n$，要求以最小的修改次数，使其成为 $1$ 到 $n$ 的排列，输出修改后的数组（如果答案有多个，输出任意一个，每个数中间用空格隔开）。 $1\le n\le 10^5$ $1\le a_i\le 10^5$