#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 5;
void c_p_c() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i += 6) {
    if (n % i == 0 || n % (i + 2) == 0) return false;
  }
  return true;
}
vector<long long> Sieve(long long n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long i = 2; i * i <= n; i++) {
    if (prime[i]) {
      for (long long j = i * i; j <= n; j += i) {
        prime[j] = false;
      }
    }
  }
  vector<long long> primes;
  for (long long i = 2; i <= n; i++) {
    if (prime[i]) primes.push_back(i);
  }
  return primes;
}
set<long long> primeFactors(long long n) {
  set<long long> factors;
  while (n % 2 == 0) {
    n /= 2;
    factors.insert(2);
  }
  for (long long i = 3; i <= sqrt(n); i += 2) {
    while (n % i == 0) {
      factors.insert(i);
      n /= i;
    }
  }
  if (n > 2) factors.insert(n);
  return factors;
}
long long power(long long x, unsigned long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
set<long long> squares;
bool isSquare(string s) {
  long long m = s.length();
  long long n = 0;
  for (long long i = 0; i < m; i++) {
    n = n * 10 + (s[i] - '0');
  }
  if (squares.count(n))
    return true;
  else
    return false;
}
bool check(string s) {
  long long n = s.length();
  for (long long i = 0; i < n; i++) {
    if (s[i] == '1' || s[i] == '4' || s[i] == '9') return true;
  }
  return false;
}
int32_t main() {
  c_p_c();
  long long gl, gr;
  long long bl, br;
  cin >> gl >> gr >> bl >> br;
  if ((br >= gl - 1 && 2 * (gl + 1) >= br) ||
      (bl >= gr - 1 && 2 * (gr + 1) >= bl))
    cout << "YES" << '\n';
  else
    cout << "NO" << '\n';
}
