#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pb emplace_back
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){for(auto x:v)outv(x);}
template<class T> void outp(T p){cout<<'('<<p.fi<<','<<p.se<<')'<<endl;}
ll minimum_walk(vector<int> p,int s){
int n=p.size();
vb done(n,false);
rep(i,n)if(p[i]==i)done[i]=true;
ll ans=0;
vp v;v.pb(s,s);
rep(i,n)if(!done[i]){
ll mi=i,ma=i;
ll nw=p[i];
ans+=abs(nw-i);
while(nw!=i){
done[nw]=true;
chmax(ma,nw);chmin(mi,nw);
ans+=abs(nw-p[nw]);
nw=p[nw];
}
v.pb(mi,ma);
}
sort(all(v));
vp st;
for(auto x:v){
if(st.size()&&st.back().se>=x.fi)chmax(st.back().se,x.se);
else{
if(st.size())ans+=(x.fi-st.back().se)*2;
st.pb(x);
}
}
return ans;
}
/*
int main(){
ll n;cin>>n;
vector<int> v(n);rep(i,n)cin>>v[i];
out(minimum_walk(v,0));
}*/
