Codeforces 864D Make a Permutation! (贪心+维护)思维好题

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.

#include<iostream>
#include<algorithm>
#include<string>
#include<map>//int dx[4]={0,0,-1,1};int dy[4]={-1,1,0,0};
#include<set>//int gcd(int a,int b){return b?gcd(b,a%b):a;}
#include<vector>
#include<cmath>
#include<stack>
#include<string.h>
#include<stdlib.h>
#include<cstdio>
#define mod 1e9+7
#define ll long long
#define maxn 200005
#define MAX 1000000000
#define ms memset
using namespace std;
/*
题目大意：给定n个数，
问如何修改使得该序列为一个排列，
要求尽量修改的数字次数少，
次数一样的情况下字典序小。

比较好的贪心思想：
对于一个最小的在序列里没出现到的数字，
如果遇到了一个重复出现的数字，
如果该数字比选中的数大，
那么肯定要产生替换。

如果该数字小，那么
要看情况替换，
如果是第一次出现则不能替换，
因为不如第二次替换来的划算，
如果是第二次，那么肯定要替换
不替换的话重复度没有消去。

这些操作都要涉及到维护，
第一次数字出现的位置。
首先倒叙遍历初始化nxt数组和show数组，
有点像建立链表。。。。详情见代码
*/
int n,ans;
int seq[maxn];
int vis[maxn] , show[maxn] ,nxt[maxn];

int main()
{
    memset(nxt,0xff,sizeof(nxt));///初始化为-1
    memset( show, 0 , sizeof(show));
    memset( vis , 0 , sizeof(vis));

    scanf("%d",&n);  ans=0;
    for(int i=1;i<=n;i++)
    {
        int x ;scanf("%d",&x);
        seq[i] = x;
        vis[x]++;
        if(vis[x]>1) ans++;
    }

    for(int i=n;i>=1;i--)
    {
        int x=seq[i];
        if(show[x]==0) show[x]=i;
        else
        {
            nxt[i]=show[x];
            show[x]=i;
        }
    }

    int j=1;

    for(int i=1;i<=n;i++)
    {
        if(vis[i]) continue;///一旦找到需要替换的最小的那个数
        while(j<=n)
        {
            int x=seq[j];
            if(vis[x]>1)
            {
                if(x>i)
                {
                    seq[j]=i;
                    vis[x]--;
                    if(show[x]==j)   show[x]=nxt[j];///更新第一次出现的位置
                    break;
                }
                else if(x<i&&show[x]!=j)///不是第一次出现
                {
                    vis[x]--;
                    seq[j]=i;
                    break;
                }
            }
            j++;
        }
    }
        printf("%d\n",ans);
        printf("%d",seq[1]);
        for(int i=2;i<=n;i++) printf(" %d",seq[i]);
        puts("");


    return 0;
}