#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxs = 3e5;
const int maxn = 1e5;
int f[maxs],o[maxn];
int valid(int n, int s[]){
int st = -1,mn = n+1;
for(int i=0;i<n;i++){
if(f[s[i]])return 0;
f[s[i]] = 1;
if(s[i] < mn){
st = i;
mn = s[i];
}
}
if(st == -1)return 1;
for(int i=st;i<n;i++){
if(s[i] <= n && s[i] != mn)return 0;
mn++;
}
for(int i=0;i<st;i++){
if(s[i] <= n && s[i] != mn)return 0;
mn++;
}
return 1;
}
//----------------------
int replacement(int n, int s[], int rep[]){
int l=0;
int st = -1,mn = n+1;
vector<pair<int,int>> to;
for(int i=0;i<n;i++){
if(s[i] <= mn){
st = i;
mn = s[i];
}
if(s[i] > n)to.push_back({s[i],i});
}
sort(to.begin(),to.end());
if(st == -1){
st = 0;
mn = 1;
}
for(int i=st;i<n;i++){
o[i] = mn++;
mn%=(n+1);
if(!mn)mn++;
}
for(int i=0;i<st;i++){
o[i] = mn++;
mn%=(n+1);
if(!mn)mn++;
}
int cur = n+1;
for(int i=0;i<(int)to.size();i++){
int id = to[i].second;
while(o[id] < to[i].first){
rep[l++] = o[id];
o[id] = cur;
cur++;
}
}
return l;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
