// Oh damn! Suddenly you're free to fly...
#include<bits/stdc++.h>
#include "books.h"
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1e6 + 10, mod = 1e9 + 7, inf = 1e9 + 10;
int cnt[maxn];
ll minimum_walk(vector<int> p, int s){
int n = sz(p);
assert(s == 0);
ll ans = 0;
while(n > 1 && p[n-1] == n-1)
n--, p.pop_back();
for(int i = 0; i < n; i++){
int l = i, r = p[i];
if(l > r)
swap(l, r);
ans+= r-l;
cnt[l]++, cnt[r]--;
}
int sm = 0;
for(int i = 0; i < n-1; i++){
sm+= cnt[i];
ans+= (sm > 0 ? 0 : 2);
}
return ans;
}
