#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
typedef long long ll;
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
const int MOD = 1'000'000'007;
const int MX = 100'005;
//long double PI = 3.14159265358979323846264338327950;
int valid(int n, int inputSeq[])
{
//return -1;
int a[250005];
memset(a,-1,sizeof(a));
for(int i=0; i<n; i++){
if(a[inputSeq[i]-1]!=-1){
return 0;
}
a[inputSeq[i]-1]=i;
}
int b[n];
memset(b,-1,sizeof(b));
for(int i=0; i<n; i++){
if(a[i]!=-1){
b[i]=a[i];
for(int j=i+1; j<i+n; j++){
b[j%n]=(b[(j-1)%n]+1)%n;
}
break;
}
}
//for(int i=0; i<n; i++) cout<<b[i]<<' ';
//cout<<'\n';
for(int i=0; i<n; i++){
if(a[i]!=-1&&b[i]!=-1){
if(a[i]!=b[i]) return 0;
}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
/*void caso_teste(){
}*/
/*
int main(){
cin.tie(0);ios_base::sync_with_stdio(0);
//freopen ("in.txt","r",stdin);
int n_casos=1; //cin>>n_casos;
//while(n_casos--) caso_teste();
int a[4]={511, 511, 511, 511};
cout<<valid(7, a);
}*/
