#include <bits/stdc++.h>
#include <gondola.h>
using namespace std;
#define FOR(i, a, b) for(int i = a; i <= b; i++)
int diff(int n, int a, int b){
if(b >= a) return b - a;
else return (n - a) + b;
}
int valid(int n, int inputSeq[]){
pair<int, int> prev = make_pair(-1, 0);
set<int> s;
FOR(i, 0, n - 1){
if(inputSeq[i] <= n){
if(prev.first == -1){
prev = make_pair(i, inputSeq[i]);
}else{
if((((prev.second + diff(n, prev.first, i)) % n) == 0 ? n : ((prev.second + diff(n, prev.first, i)) % n)) != inputSeq[i]) return 0;
prev = make_pair(i, inputSeq[i]);
}
}else{
if(s.find(inputSeq[i]) != s.end()) return 0;
s.insert(inputSeq[i]);
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int idx = -1, mx = -1;
vector<pair<int, int> > v;
FOR(i, 0, n - 1){
if(gondolaSeq[i] <= n){
idx = gondolaSeq[i] - i;
if(idx <= 0) idx += n;
}else{
v.push_back(make_pair(gondolaSeq[i], i));
}
mx = max(mx, gondolaSeq[i]);
}
sort(v.begin(), v.end());
if(idx == -1) idx = 1;
set<int> s;
FOR(i, 0, (int)(v.size() - 1)) s.insert(v[i].first), replacementSeq[i] = ((idx + v[i].second) % n == 0) ? n : ((idx + v[i].second) % n);
int i2 = v.size(), k = -1;
FOR(i, n + 1, mx) {
if(s.find(i) == s.end()) {
if(k == -1) k = i;
else {
replacementSeq[i2] = k;
k = i, i2++;
}
}
}
return i2;
}
int countReplacement(int n, int inputSeq[]){
return 1;
}
