#include "gondola.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
ll mod=99824LL;
int valid(int n, int inputSeq[])
{
ll N=(ll) n;
vector<ll> s; REP(i,0,N) {s.pb((ll) inputSeq[i]);}
REP(i,0,N) {if(s[i]>N) {s[i]=-1;} else {s[i]--;}}
ll fi=-1;
REP(i,0,N) {if(s[i]!=-1) {fi=i; break;}}
if(fi==-1) {return 1;}
REP(i,0,N)
{
if(s[i]==-1) {continue;}
if(((s[i]-i)-(s[fi]-fi))%N!=0) {return 0;}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
