#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
set<int> values;
int valid(int n, int inputSeq[])
{
bool valid=true;int last=-1;
for (int i=0;i<n;i++)
{
if (inputSeq[i]<=n and last==-1) {last=i;continue;}
if (inputSeq[i]>n) continue;
int diff=inputSeq[i]-inputSeq[last];
if (diff<0) diff+=n;
if (diff!=i-last) {valid=false;break;}
last=i;
}
for (int i=0;i<n;i++) values.insert(inputSeq[i]);
if (valid and (int)values.size()==n) return 1;
return 0;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return 0;
}
int countReplacement(int n, int inputSeq[])
{
return 0;
}
