Codeforces Round #436 (Div. 2) - D. 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.

题意：

给你一个序列，让你用最少次的改变数，来使这个序列变成1到n的排列。答案要字典序最小。输出次数和排列。

POINT：

先找出需要哪些数，然后一个一个判断。

当然是重复的数改成这些需要数，需要数从小到大排序。

重复的数如果比最小需要数小，那么就保留这一个《第一个》重复的数，后面还遇到了这个数就直接替换为最小需要数。

如果比最小需要数大，直接替换，直到不重复。

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
#include<algorithm>
using namespace std;
#define LL long long
const int maxn = 200100;
int a[maxn];
int cnt[maxn];
int kk[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        cnt[a[i]]++;
    }
    int num=0;
    int ans[maxn];
    for(int i=1;i<=n;i++){
        if(cnt[i]==0){
            ans[++num]=i;
        }
    }

   // memset(kk,0,sizeof kk);
    int c=1;
    for(int i=1;i<=n&&c<=num;i++){
        if(kk[a[i]]){
            a[i]=ans[c++];
            continue;
        }
        if(cnt[a[i]]>=2){
            if(ans[c]<a[i]){
                cnt[a[i]]--;
                a[i]=ans[c++];
            }
            else
                kk[a[i]]=1;
        }
    }
    printf("%d\n",num);
    for(int i=1;i<=n;i++){
        if(i-1) printf(" ");
        printf("%d",a[i]);
    }
    printf("\n");

}