#pragma GCC optimize("Ofast")
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int valid(int n, int inputSeq[])
{
vector<int>a(n);
for(int i=0;i<n;i++)a[i] = inputSeq[i];
int mn=1e9,id=0,mx = 0;
bool ok = 1;
map<int,bool>seen;
vector<pii>pos;
for(int i=0;i<n;i++){
if(a[i] < mn){
mn = a[i];
id = i;
}
if(seen[a[i]])ok = 0;
seen[a[i]] = 1;
mx = max(mx,a[i]);
}
vector<int>b;
for(int i=0;i<n;i++){
b.pb(a[(id+i)%n]);
}
for(int i=0;i<n;i++){
if(b[i]<=n)pos.pb({b[i],i});
}
if(mx == n){
sort(all(a));
if(a != b)ok = 0;
}else{
mx = 0;
for(int i=0;i<sz(pos);i++){
if(mx > pos[i].fi){ok=0;break;}
else{
if(i && pos[i].se - pos[i-1].se != pos[i].fi - pos[i].fi-1)ok = 0;
}
}
}
return ok;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
