#include "gondola.h"
#include <bits/stdc++.h>
#define SZ(v) ((int)(v).size())
using namespace std;
using ll = long long;
int valid(int n, int inputSeq[])
{
vector<int> order;
for (int i(0); i < n; ++i)
{
int cur = inputSeq[i];
if (cur <= n)
order.push_back(cur);
}
if (SZ(order) == 0) return 1;
int posInv(0);
while (posInv + 1 < SZ(order) and order[posInv] < order[posInv+1])
posInv++;
if (posInv + 1 == SZ(order))
return 1;
vector<int> finalOrder;
for (int i(posInv+1); i < SZ(order); ++i)
finalOrder.push_back(order[i]);
for (int i(0); i <= posInv; ++i)
finalOrder.push_back(order[i]);
order = move(finalOrder);
for (int i(0); i+1 < SZ(order); ++i)
if (order[i] >= order[i+1])
return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
