#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int valid(int n, int inputSeq[]){
vi a;
vi vec;
map<int, int> cnt;
pii mn = {10000000, 0};
for(int i = 0; i < n; i++){
a.pb(inputSeq[i]);
cnt[a[i]]++;
if(a[i] < mn.fi){
mn.fi = a[i];
mn.se = i;
}
}
for(auto ele : cnt){
if(ele.se > 1){
return 0;
}
}
vi na;
for(int i = mn.se; i < n; i++){
na.pb(a[i]);
}
for(int i = 0; i < mn.se; i++){
na.pb(a[i]);
}
a = na;
for(int i = 0; i < n; i++){
if(a[i] <= n){
vec.pb(i);
}
}
if(sz(vec) <= 1){
return 1;
}
for(int i = 0; i + 1 < sz(vec); i++){
if(a[vec[i + 1]] <= a[vec[i]]){
return 0;
}
if(vec[i + 1] - vec[i] != a[vec[i + 1]] - a[vec[i]]){
return 0;
}
}
if(n - vec.back() - 1 != (n - a[vec.back()] + a[vec[0]] - 1)){
return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[]){
return -3;
}
