Codeforces Round #315 (Div. 2) B 水题强行set

B. Inventory

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

The first line contains a single integer n — the number of items (1 ≤ n ≤ 105).

The second line contains n numbers a1, a2, ..., an (1 ≤ ai ≤ 105) — the initial inventory numbers of the items.

Output

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.

Examples

input

3
1 3 2

output

1 3 2 

input

4
2 2 3 3

output

2 1 3 4 

input

1
2

output

1 

Note

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.

 题解：要求1~n的数字排列  若不满足，则更改尽量少的数字 使得满足1~n的任意排列

 题意：随便搞   强行set处理 顺便再次熟悉一下set的方法  具体看代码

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#define ll __int64
#define mod 1000000007
#define PI acos(-1.0)
using namespace std;
set<int> s;
map<int,int>mp;
map<int,int>biao;
int main()
{
    int n;
    int exm;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        if(biao[i]==0)
        s.insert(i);
        scanf("%d",&exm);
        if(biao[exm]==0&&exm>=1&&exm<=n)
        {
          biao[exm]=1;
          mp[i]=exm;
          if(s.count(exm)==1)
          s.erase(exm);
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(mp[i])
        {
            cout<<mp[i]<<" ";
        }
        else
        {
            set<int>::iterator  it = s.begin();
            cout<<*it<<" ";
            s.erase(*it);
        }
    }
    return 0;
}