#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;
int valid(int n, int inputSeq[])
{
bool flag=1;
int pos=0,val=inf;
REP(i,0,n)if(inputSeq[i]<val){
val=inputSeq[i];
pos=i;
}
if(val>n){
sort(inputSeq,inputSeq+n);
REP(i,0,n-1)if(inputSeq[i]==inputSeq[i+1])flag=0;
return 1;
}
int c=pos;
pos++;val++;
pos%=n;val%=n;if(val==0)val=n;
while(pos!=c){
if(inputSeq[pos]!=val&&inputSeq[pos]<=n){
flag=0;
break;
}
pos++;val++;
pos%=n;val%=n;if(val==0)val=n;
}
sort(inputSeq,inputSeq+n);
REP(i,0,n-1)if(inputSeq[i]==inputSeq[i+1])flag=0;
if(flag)return 1;
return 0;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
