#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b,l,r;
ll res=0;
int used[1000001];
vector<pii(int)> lmao[1001];
int dp[1001][1001];
int sl[1001][1001];
int sr[1001][1001];
#include "books.h"
long long minimum_walk(std::vector<int> p, int s) {
n=p.size();
if (n>1000) return 0;
for (i=0;i<n;i++) {
used[i]=0;
lmao[i].clear();
}
t=0;
res=0;
l=r=s;
for (i=0;i<n;i++) if (!used[i]) {
vec.clear();
t++;
u=i;
while(true) {
vec.push_back(u);
used[u]=t;
u=p[u];
if (used[u]) break;
}
v = vec.size();
// cout<<v<<endl;
for (j=0;j<v;j++) {
res+=abs(vec[j]-vec[(j+1)%v]);
}
// cout<<res<<endl;
if (vec.size()>1) {
u=1e9;
v=-1e9;
for (auto g : vec) u=min(u,g);
for (auto g : vec) v=max(v,g);
lmao[u].push_back({u,v});
lmao[v].push_back({u,v});
l=min(l,u);
r=max(r,v);
}
}
for (i=0;i<n;i++) {
u=i;
v=i;
for (j=i;j<n;j++) {
v=max(v,j);
for (auto g : lmao[j]) {
u=min(u,g.fi);
v=max(v,g.se);
}
sl[i][j]=u;
sr[i][j]=v;
dp[i][j]=1e9;
}
}
a=1e9;
dp[s][s]=0;
for (j=0;j<n;j++) {
for (i=0;i<n-j;i++) {
j+=i;
if (i<=l && j>=r) {
a=min(a,dp[i][j]);
}
dp[sl[i][j]][sr[i][j]]=min(dp[sl[i][j]][sr[i][j]],dp[i][j]);
if (i-1>=0) {
dp[i-1][j]=min(dp[i-1][j],dp[i][j]+2);
}
if (j+1<n) {
dp[i][j+1]=min(dp[i][j+1],dp[i][j]+2);
}
j-=i;
}
}
return res+a;
}
// Normie28;
