#include<bits/stdc++.h>
#include<cstring>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<map>
#define ll long long
using namespace std;
const int N=1e5+10;
const int M=2023;
const int inf=0x3f3f3f3f;
int n,pos,l,r;
int main()
{
	cin>>n>>pos>>l>>r;
	if(l==1 and r==n)
	{
		cout<<0;
		return 0;
	}
	if(l==1)
	{
		cout<<abs(pos-r)+1;
		return 0;
	}
	if(r==1)
	{
		cout<<abs(pos-l)+1;
	}
	else 
	{
		cout<<min(abs(pos-l),abs(pos-r))+1+abs(l-r)+1;
		
	}
	return 0;
}