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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void io() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}
long long mod = 1e9 + 7, mxn = 3e5 + 5;
void deb(vector<long long> v) {
  for (auto t : v) cerr << t << " ";
  cerr << "\n";
}
long long mul(long long a, long long b, long long mod) {
  a %= mod;
  b %= mod;
  a *= b;
  a += mod;
  return a % mod;
}
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second > b.second;
}
bool check_sorted(vector<long long> a) {
  long long n = a.size();
  for (long long i = 1; i < n; i++) {
    if (a[i] >= a[i - 1]) continue;
    return false;
  }
  return true;
}
long long po(long long a, long long b, long long mod) {
  if (b == 0) return 1;
  if (b % 2 == 0) return po(mul(a, a, mod), b / 2, mod);
  return mul(a, po(mul(a, a, mod), (b - 1) / 2, mod), mod);
}
long long power(long long X, long long N) {
  if (N == 0) return 1;
  if (N % 2 == 0) return power(X * X, N / 2);
  return X * power(X, N - 1);
}
vector<long long> fac(200003);
long long facto(long long n) {
  fac[0] = 1;
  fac[1] = 1;
  for (long long i = 2; i <= 200003; i++) {
    fac[i] = i * fac[i - 1];
  }
  return fac[n];
}
long combi(long long n, long long k) {
  long long ans = 1;
  k = k > n - k ? n - k : k;
  long long j = 1;
  for (; j <= k; j++, n--) {
    if (n % j == 0) {
      ans *= n / j;
    } else if (ans % j == 0) {
      ans = ans / j * n;
    } else {
      ans = (ans * n) / j;
    }
  }
  return ans;
}
vector<int> sieveOfEratosthenes(int N) {
  bool primes[N + 1];
  memset(primes, true, sizeof(primes));
  vector<int> arr;
  for (int i = 2; i * i <= N; i++)
    if (primes[i] == true) {
      for (int j = i * i; j <= N; j += i) primes[j] = false;
    }
  for (int i = 2; i <= N; i++)
    if (primes[i]) arr.emplace_back(i);
  return arr;
}
void prime_fact(long long n, vector<long long> &res) {
  while (n % 2 == 0) {
    res.push_back(2);
    n = n / 2;
  }
  for (long long i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      res.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) {
    res.push_back(n);
  }
}
void solve() {
  long long n, pos, l, r;
  cin >> n >> pos >> l >> r;
  vector<long long> a(n + 1);
  for (long long i = 1; i <= n; i++) {
    a[i] = i;
  }
  if (l == 1 && r == n)
    cout << 0;
  else if (l == 1) {
    cout << 1 + abs(pos - r);
  } else if (r == n) {
    cout << 1 + abs(pos - l);
  } else
    cout << 2 + r - l + min(abs(pos - l), abs(pos - r));
  return;
}
int main() {
  io();
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}