#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
bool visited[250000];
int valid(int n,int input[]){
int start = -1;
for(int i=0;i<n;i++)if(input[i]<=n){
start = i;
break;
}
if(start==-1)return 1;
int prev = input[start];
if(prev==n)prev =0;
for(int i=start+1;i<n;i++){
// cout << input[i] << "\t" << prev << "\n";
if(input[i]<=n&&input[i]!=prev+1)return 0;
if(visited[input[i]-1])return 0;
visited[input[i]-1] = true;
if(prev+1==n)prev = 0;
else
prev++;
}
for(int i=0;i<start;i++){
// cout << input[i] << "\t" << prev << "\n";
if(input[i]<=n&&input[i]!=prev+1)return 0;
if(visited[input[i]-1])return 0;
visited[input[i]-1] = true;
if(prev+1==n)prev = 0;
else
prev++;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int MAX = 0;
for(int i=0;i<n;i++){
visited[gondolaSeq[i]]=true;
MAX = max(MAX,gondolaSeq[i]);
}
int l = 0;
for(int i=1;i<MAX;i++)
if(!visited[i])replacementSeq[l++]=i;
return l;
}
int countReplacement(int n, int inputSeq[]){
return 0;
}
// int main(){
// while(true){
// int n;
// cin >> n;
// int arr[n];
// int temp[n];
// for(int i=0;i<n;i++)cin >> arr[i];
// cout << replacement(n,arr,temp) << "\n";
// }
// }
