#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define pii pair<int,int>
int valid(int n, int inputSeq[]){
set<int> s(inputSeq,inputSeq+n);
if ((int)s.size()<n)return 0;
pii mn={n+1,-1};
for (int i = 0; i<n; i++){
if (inputSeq[i]<mn.first)mn={inputSeq[i],i};
}
int cur=mn.first;
for (int i = mn.second+1; i<n; i++){
if (inputSeq[i]<=n && inputSeq[i]!=++cur)return 0;
}
for (int i = 0; ++cur<=n; i++){
if (inputSeq[i]<=n && inputSeq[i]!=cur)return 0;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int st=0;
for (int i = 0; i<n; i++){
if (gondolaSeq[i]<=n){
st=(i-gondolaSeq[i]+1+n)%n;
break;
}
}
vector<int> kol(n);
for (int i = st; i<n+st; i++)kol[i-st]=gondolaSeq[i%n];
priority_queue<pii,vector<pii>,greater<pii>> pq;
int l=0,bro=n+1;
for (int i = 0; i<n; i++){
if (kol[i]>n)pq.push({kol[i],i+1});
}
while(pq.size()){
pii now=pq.top();
pq.pop();
replacementSeq[l++]=now.second;
while(bro<now.first)replacementSeq[l++]=bro++;
}
return l;
}
int countReplacement(int n, int inputSeq[]){
if (!valid(n,inputSeq))return 0;
return 1;
}
