Problem: Luba is surfing the Internet. She currently has n opened tabs in her browser, indexed from 1 to n from left to right. The mouse cursor is currently located at the pos-th tab. Luba needs to use the tabs with indices from l to r (inclusive) for her studies, and she wants to close all the tabs that don't belong to this segment as fast as possible.

Each second Luba can either try moving the cursor to the left or to the right (if the cursor is currently at the tab i, then she can move it to the tab max(i - 1, a) or to the tab min(i + 1, b)) or try closing all the tabs to the left or to the right of the cursor (if the cursor is currently at the tab i, she can close all the tabs with indices from segment [a, i - 1] or from segment [i + 1, b]). In the aforementioned expressions a and b denote the minimum and maximum index of an unclosed tab, respectively. For example, if there were 7 tabs initially and tabs 1, 2 and 7 are closed, then a = 3, b = 6.

What is the minimum number of seconds Luba has to spend in order to leave only the tabs with initial indices from l to r inclusive opened?

Input

The only line of input contains four integer numbers n, pos, l, r (1 ≤ n ≤ 100, 1 ≤ pos ≤ n, 1 ≤ l ≤ r ≤ n) — the number of the tabs, the cursor position and the segment which Luba needs to leave opened.

Output

Print one integer equal to the minimum number of seconds required to close all the tabs outside the segment [l, r].

Examples

Input

6 3 2 4


Output

5


Input

6 3 1 3


Output

1


Input

5 2 1 5


Output

0

Note

In the first test Luba can do the following operations: shift the mouse cursor to the tab 2, close all the tabs to the left of it, shift the mouse cursor to the tab 3, then to the tab 4, and then close all the tabs to the right of it.

In the second test she only needs to close all the tabs to the right of the current position of the cursor.

In the third test Luba doesn't need to do anything.

Solution (in JAVA):

Solution:
import java.awt.Point;
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.*;
import java.util.*;

public class Main {
	//////
	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

	//////
	public static long modularExponentiation(long x, long n, long M) {
		long result = 1;
		while (n > 0) {
			if (n % 2 == 1)
				result = (result * x) % M;
			x = (x * x) % M;
			n = n / 2;
		}
		return result;
	}

	public static long modularExponentiation1(long x, long n) {
		long result = 1;
		while (n > 0) {
			if (n % 2 == 1)
				result = (result * x);
			x = (x * x);
			n = n / 2;
		}
		return result;
	}

	/////
	static long d(int x, int y) {
		if (Math.abs(x - y) > 1) {
			return y - x;
		} else
			return 0;

	}

	static int closestSquare(int num) {

		if (num == 0) {
			return -1;
		}
		int root = (int) Math.sqrt(num);
		int another = root + 1;
		root = root * root;
		another = another * another;
		if (another - num > num - root) {
			return num - root;
		} else
			return another - num;

	}

	public static void main(String[] args) throws IOException {

		FastReader scan = new FastReader();
		PrintWriter pw = new PrintWriter(System.out);

		int N = scan.nextInt();
		int pos = scan.nextInt();
		int L = scan.nextInt();
		int R = scan.nextInt();

		int count = 0;
		if(L==1&&R==N){
			System.out.println("0");
			return;
		}
		
		if (Math.abs(pos - L) < Math.abs(pos - R)) {
			if(L!=1){
			count += Math.abs(pos - L);
			
			if (L == 1) {

			} else
				count += 1;
			
			if (R == N ) {

			} else{
				count += R - L;
				count += 1;
			}
			}else{
				if (R == N ) {

				} else{
					count += Math.abs(pos - R);
					count += 1;
				}
			}

		} else {
			if(R!=N){
			count += Math.abs(pos - R);
			
			if (R == N) {

			} else
				count += 1;
			
			if (L == 1) {

			} else{
				count += 1;
				count += R - L;
				}
			}else{
				if (L == 1) {

				} else{
					count += 1;
					count += Math.abs(pos - L);
					}
			}
		}
		System.out.println(count);

	}
}

class Node {

	int data;
	Node next;

	Node(int data) {
		this.data = data;
	}

}

class Stack {

	Node root;

	void push(int data) {
		Node newNode = new Node(data);
		newNode.next = root;
		root = newNode;
	}

	void pop() {
		root = root.next;
	}

	void print() {

		Node temp = root;
		while (temp != null) {
			System.out.print(temp.data + " ");
			temp = temp.next;
		}

	}

}