#include "gondola.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int valid(int n, int inputSeq[])
{
vector<int>extra;
for(int i=0 ; i<n ; i++){
int curr=inputSeq[i], next=inputSeq[(i+1)%n];
if(curr>n) extra.push_back(curr);
if(next>n || curr>n) continue;
if((next-curr+n)%n>1) return 0;
}
sort(extra.begin(), extra.end());
for(int i=0 ; i<(int)extra.size()-1 ; i++){
if(extra[i+1]-extra[i]>1) return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
