#include <bits/stdc++.h>
using namespace std;
#ifndef wambule
#include "gondola.h"
#endif
void G(int a[], int b[], int n) {
for(int i = 0; i < n; ++i) a[i] = b[i];
}
void D(int a[], int n) {
int j = 0;
for(int i = 0; i < n; ++i) {
if(a[i] <= n) {
j = i - a[i] + 1;
if(j < 0) j += n;
break;
}
}
int b[n];
G(b, a, n);
for(int i = j; i < n; ++i) {
a[i - j] = b[i];
}
for(int i = 0; i < j; ++i) {
a[n - j + i] = b[i];
}
}
int valid(int n, int _g[]) {
int g[n];
G(g, _g, n);
D(g, n);
int d[n];
G(d, g, n);
sort(d, d + n);
for(int i = 1; i < n; ++i) {
if(d[i] == d[i - 1]) return 0;
}
for(int i = 0; i < n; ++i) {
if(g[i] <= n && g[i] != i + 1) return 0;
}
return 1;
}
int replacement(int n, int _g[], int r[]) {
int g[n];
G(g, _g, n);
D(g, n);
vector<pair<int, int> > v;
for(int i = 0; i < n; ++i) {
if(g[i] > n) {
v.push_back({g[i], i});
}
}
sort(v.begin(), v.end());
int x = n + 1, rg = 0;
for(int i = 0; i < (int)v.size(); ++i) {
int gf = v[i].second + 1;
while(x <= v[i].first) {
r[rg] = gf;
gf = x;
++x;
++rg;
}
}
return rg;
}
int countReplacement(int n, int _g[]) {
int g[n];
G(g, _g, n);
D(g, n);
return 0;
}
#ifdef wambule
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n = 3;
int a[] = {3, 1, 4};
int b[100];
int r = replacement(n, a, b);
cout << r << endl;
for(int i = 0; i < r; ++i) {
cout << b[i] << " ";
}
cout << endl;
return 0;
}
#endif
