//Start: 2025-02-06 16:03:59
#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);++i)
#define ForDown(i,j,k) for(int i=(j);i>=(k);--i)
#define Debug(fmt, args...) fprintf(stderr,"(func %s, line #%d): " fmt, __func__, __LINE__, ##args),fflush(stderr)
#define debug(fmt, args...) fprintf(stderr,fmt,##args),fflush(stderr)
#define within :
#define LJY main
using namespace std;
typedef long long ll;
const int N=1e5+5,M=205;
const ll inf=1e18;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
inline int read(){
  char ch=getchar();int x=0,f=1;
  while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
  while(ch>='0'&&ch<='9')
    x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return x*f;
}
int n,a[N],pos[N],l,r;
int stk[N],tp,ls[N],rs[N],rt,siz[N];
int s[M],tot;ll f[M][M];
void dfs(int u){
  if(!u||pos[u]>r){tot++;s[tot]=s[tot-1]+siz[u];return;}
  dfs(ls[u]);dfs(rs[u]);
}
ll solve(int x){
  tot=0;dfs(x);
  ForDown(l,tot,1) For(r,l+1,tot){
    f[l][r]=inf;
    For(k,l,r-1) f[l][r]=min(f[l][r],f[l][k]+f[k+1][r]);
    f[l][r]+=r-l+s[r]-s[l-1];
  }return f[1][tot];
}
signed LJY(){
  n=read();For(i,1,n) pos[a[i]=read()]=i;l=read(),r=read();
  For(i,1,n){
    int lst=tp;
    while(pos[stk[tp]]>pos[i]) tp--;
    if(lst!=tp) ls[i]=stk[tp+1];
    if(tp) rs[stk[tp]]=i;else rt=i;stk[++tp]=i;
  }ForDown(i,n,1) siz[a[i]]=siz[ls[a[i]]]+siz[rs[a[i]]]+1;
  ll ans=(l==1?solve(a[1]):0);
  For(i,1,n) if(pos[i]<l||pos[i]>r){
    ans+=siz[i];
    if(pos[ls[i]]>=l&&pos[ls[i]]<=r) ans+=solve(ls[i]);
    if(pos[rs[i]]>=l&&pos[rs[i]]<=r) ans+=solve(rs[i]);
  }printf("%lld",ans);
  return 0;
}