#include<bits/stdc++.h>
#include "gondola.h"
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/*
less<T> can be changed to:
1. less_equal<T>
2. greater<T>
ordered_set functions:
1. *(os.find_by_order(x)) -> return the value at position x (0 base)
2. os.order_of_key(x) -> return the number of elements less than x
*/
typedef long long ll;
//#define int ll
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
const int MOD=1000000007;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define fios(); ios_base::sync_with_stdio(0);cin.tie(0);
#define fraction(x); cout.unsetf(ios::floatfield); cout.precision(x); cout.setf(ios::fixed,ios::floatfield);
#define file(); freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
const int maxN=2e5+15;
int a[maxN];
int valid(int n,int arr[]){
int ind=0;
for(int i=0;i<n;i++){
if(arr[i]<arr[ind]) ind=i;
}
for(int i=ind;i<n;i++) a[i-ind]=arr[i];
for(int i=0;i<ind;i++) a[i+(n-ind)]=arr[i];
int test[n];
for(int i=0;i<n;i++) test[i]=i+1;
int cur=n+1;
for(int i=0;i<n;i++){
if(test[i]!=a[i]){
while(test[i]<a[i]){
test[i]=cur;
cur=cur+1;
}
if(test[i]>a[i]) return 0;
//cout<<i<<' '<<cur<<' '<<a[i]<<endl;
}
}
return 1;
}
int replacement(int n,int gondolaSeq[],int replacementSeq[]){
return 0;
}
int countReplacement(int n,int inputSeq[]){
return 0;
}
