codeforce 849D. Make a Permutation!

D. Make a Permutation!

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.

Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (replace) minimum number of elements in his array in such a way that his array becomes a permutation (i.e. each of the integers from 1 to n was encountered in his array exactly once). If there are multiple ways to do it he wants to find the lexicographically minimal permutation among them.

Thus minimizing the number of changes has the first priority, lexicographical minimizing has the second priority.

In order to determine which of the two permutations is lexicographically smaller, we compare their first elements. If they are equal — compare the second, and so on. If we have two permutations x and y, then x is lexicographically smaller if xi < yi, where i is the first index in which the permutations x and y differ.

Determine the array Ivan will obtain after performing all the changes.

Input

The first line contains an single integer n (2 ≤ n ≤ 200 000) — the number of elements in Ivan's array.

The second line contains a sequence of integers a1, a2, ..., an (1 ≤ ai ≤ n) — the description of Ivan's array.

Output

In the first line print q — the minimum number of elements that need to be changed in Ivan's array in order to make his array a permutation. In the second line, print the lexicographically minimal permutation which can be obtained from array with q changes.

Examples

input

4
3 2 2 3

output

2
1 2 4 3 

input

6
4 5 6 3 2 1

output

0
4 5 6 3 2 1 

input

10
6 8 4 6 7 1 6 3 4 5

output

3
2 8 4 6 7 1 9 3 10 5 

Note

In the first example Ivan needs to replace number three in position 1 with number one, and number two in position 3 with number four. Then he will get a permutation [1, 2, 4, 3] with only two changed numbers — this permutation is lexicographically minimal among all suitable.

In the second example Ivan does not need to change anything because his array already is a permutation.

题意：给以一个序列，问最少改变多次次可以得到一个字典序最小的全排列。

题解：看到时间和这个数量级就应该想到贪心，核心就是需要改变的数字一定是重复的数字。我们把所有重复数字标记一下，然后把需要加进去的数字尽可能的放在靠前的位置（如果要加入的数字比重复数字小的话），重复的数字也要留一个位置，这里特殊处理一下，如果要加进去的数字比重复数字小，那么这个位置的重复数字就不要变动（说的有点绕，看下代码就好了）

ac代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
int vis[200010];
int add[200010];
//int zzvis[200010];
int a[200010];
int mark[200010];
struct node
{
    int key;
    int pos;
}ff[200010];
int main()
{
    int n;
    cin>>n;
    memset(vis,0,sizeof(vis));
    memset(mark,0,sizeof(mark));
   // memset(zzvis,0,sizeof(zzvis));
    int fcnt=0;
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        vis[a[i]]++;
    }
    int cnt=0;// q
    for(int i=1;i<=n;i++)
    {
        if(vis[i]==0) add[cnt++]=i;


        if(vis[a[i-1]]>=2)
        {
            ff[fcnt].key=a[i-1];
            ff[fcnt++].pos=i-1;
        }
    }
    int now=0;
    for(int i=0;i<cnt;i++)
    {
       // if(i==cnt-1) cout<<now<<endl;
        for(int j=now;j<fcnt;j++)
        {
            node temp=ff[j];
            if(vis[temp.key]==1) // 当这个数字只有一个的时候
            {
                if(mark[temp.key]==1) // 如果数字已经留了一次，就直接替换
                {
                   a[temp.pos]=add[i];
                   now=j+1;
                   break;
                }
                else continue; // 不然这个位置就不要变动了
            }
            if(temp.key < add[i] && mark[temp.key]==0) // 如果要加入的数字比当前遍历到的重复数字小 且这个重复数字还没定位置的时候 定下位置
            {
                vis[temp.key]--;
                mark[temp.key]=1;
               // cout<<"123"<<endl;
                continue;
            }
            else // 直接替换
            {
                a[temp.pos]=add[i];
                vis[temp.key]--;
                now=j+1;
                break;
            }
        }
    }
    //
    cout<<cnt<<endl;
    cout<<a[0];
    for(int i=1;i<n;i++)
    {
        cout<<' '<<a[i];
    }
    cout<<endl;
    return 0;
}