// ~ Be Name Khoda ~ //
#include "books.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fi first
#define se second
const int maxn = 1e6 + 10;
const int maxn5 = 1e6 + 10;
const int maxnt = 1.2e6 + 10;
const int maxn3 = 1e3 + 10;
const int mod = 1e9 + 7;
const ll inf = 1e18;
ll ans = 0;
int per[maxn5], req[maxn5];
int num = 0, av[maxn5], cnt = 0;
bool mark[maxn5];
void dfs(int v){
mark[v] = true;
req[min(v, per[v])]++;
req[max(v, per[v])]--;
ans += abs(v - per[v]);
if(!mark[per[v]])
dfs(per[v]);
}
long long minimum_walk(std::vector<int> p, int s) {
int n = p.size();
int mx = 0;
for(int i = 0; i < n; i++){
per[i] = p[i];
if(i != p[i])
mx = i;
}
fill(av, av + n + 5, n + 10);
for(int i = 0; i < n; i++) if(!mark[i]){
cnt = 0;
dfs(i);
num++;
}
int emp = 0, cur = 0;
for(int i = 0; i < mx; i++){
cur += req[i];
if(!cur) emp++;
}
return ans + 2 * emp;
}
