#include <bits/stdc++.h>
using namespace std;
vector<bool> primes(100006, false);
void sieve() {
  for (long long i = 3; i <= 100006; i += 2) {
    primes[i] = 1;
  }
  for (long long i = 3; i <= 100006; i += 2) {
    if (primes[i] == 1) {
      for (long long j = i * i; j <= 100006; j += i) {
        primes[j] = 0;
      }
    }
  }
  primes[2] = 1;
  primes[0] = primes[1] = 0;
}
int recpow(int x, int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return recpow((x * x), n / 2);
  else
    return (x * recpow((x * x), (n - 1) / 2));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, x, y;
  cin >> n >> x >> y;
  if (n == 2) {
    cout << "NO" << endl;
    return 0;
  }
  if (x != n / 2 and x != n / 2 + 1)
    cout << "YES" << endl;
  else if (y != n / 2 and y != n / 2 + 1)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
