#include<bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;++i)
using namespace std;
const int N = 6e5 + 15;
set<int> res;
int n,now[N],b[N],a[N],cur,ans[N],bf[N],c[N];
void doit(int x){
	int siz=0,bt=0;
		For(i,x,n+x-1){
			int t=*res.begin();
			if(now[b[i]]==1||siz==0||(res.empty())){
				ans[i]=cur;
				if(siz==0){
					bf[++bt]=cur; now[cur]=1;
					siz=1;
				}else{
					while(bf[bt]!=cur) 
						res.insert(bf[bt]),now[bf[bt]]=0,--bt;
					now[cur]=0,--bt;
					siz=0;
				}
			}else{
				ans[i]=t;
				bf[++bt]=t;
				res.erase(t);
			}
			bf[++bt]=b[i];
			res.erase(b[i]);
			now[b[i]]=1;
		//	For(j,1,bt) cout<<bf[j]<<" ";cout<<bt<<bt<<" "<<i<<endl;
		}
		For(i,x,n+x-1) printf("%d ",ans[i]);
}
int main(){
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	scanf("%d",&n);
	bool qq=0;
	For(i,1,n){
		scanf("%d",&b[i]); 
		c[b[i]]++;
		if(c[b[i]]>1) qq=1;
	}
	For(i,1,n) if(c[i]==0) cur=i;
	For(i,1,n) if(cur!=i&&c[i]<2) res.insert(i);
	if(qq){
		printf("%d\n",n);
		doit(1);
	}else{
		if(n==1){
			printf("-1\n");
			return 0;
		}
		printf("%d\n%d %d ",n+2,b[2],b[1]);
		b[n+1]=b[n+2]=b[2]; cur=b[1]; 
		res.erase(cur),res.erase(b[2]);
		doit(3);
	}
	return 0;
}