#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define forn(j, i, n) for(int i = j; i <= n; ++i)
#define FOR(j, i, n) for(int i = j; i < n; ++i)
#define nfor(j, i, n) for(int i = n; i >= j; --i)
#define IOS ios_base::sync_with_stdio(false), cin.tie(), cout.tie();
#define all(v) v.begin(), v.end()
#define pb push_back
const int maxn = 3e5+100;
//#define int ll
#define pii pair <int, int>
int inf = 1e9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int a[maxn], was[maxn];
int valid(int n, int inputSeq[])
{
forn(1, i, n)
{
a[i] = inputSeq[i-1];
was[a[i]]++;
if(was[a[i]] >= 2)
{
return 0;
}
}
vector <int> vec;
forn(1, i, n)
{
if(a[i] > n) continue;
vec.pb(a[i]);
}
if(vec.size() == 0) return 1;
int sz = vec.size();
int mn = -1;
FOR(0, i, sz)
{
vec.pb(vec[i]);
if(mn == -1 || vec[mn] > vec[i]) mn = i;
}
int bad = 0;
FOR(mn + 1, i, mn + sz)
{
if(vec[i] <= vec[i - 1])
{
bad = 1;
}
}
return (!bad);
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
