#include "books.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cassert>
using namespace std;
#define rep(i,n)for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define _1 first
#define _2 second
#define INF 1145141919
typedef pair<int, int> P;
int N;
bool used[1000000];
int T[1000000];
vector<int> G[1000000];
long long minimum_walk(vector<int> A, int S) {
N = A.size();
vector<P> ps;
int m = INF;
rep(i, N) if (!used[i]) {
if (i == A[i]) continue;
int x = i;
int left = x, right = x;
int lmin = INF, rmin = INF;
int w = INF;
while (!used[x]) {
left = min(left, x);
right = max(x, right);
w = min(w, abs(S-x));
if (x <= S) lmin = min(lmin, S-x);
else rmin = min(rmin, x-S);
if (x < A[x]) {
T[x]++;
T[A[x]]--;
}
used[x] = true;
x = A[x];
}
//if (left < S && S < right) G[lmin].pb(rmin);
//if (left < S && S < right) m = min(m, w);
if (left < S && S < right) m = min(m, S-left);
if (left < S && S < right) m = min(m, right-S);
}
rep(i,N-1) T[i+1] += T[i];
long long cost = 0;
bool yes = false;
for (int i=N-1; i>=S; i--) {
if (T[i])yes=true;
cost += max(T[i], (int)yes);
}
yes = false;
for (int i=0; i<S; i++) {
if (T[i])yes=true;
cost += max(T[i], (int)yes);
}
/*
int m = INF;
int rm = 0;
for (int left=N-1; left>=0; left--) {
m = min(m, left+rm);
for (int r : G[left]) rm = max(rm, r);
}
*/
if (m != INF) cost += m;
return 2LL*cost;
}
