Problem: Little Petya loves playing with squares. Mum bought him a square 2n × 2n in size. Petya marked a cell inside the square and now he is solving the following task.

The task is to draw a broken line that would go along the grid lines and that would cut the square into two equal parts. The cutting line should not have any common points with the marked cell and the resulting two parts should be equal up to rotation.

Petya wants to determine whether it is possible to cut the square in the required manner given the sizes of the square side and the coordinates of the marked cell. Help him.

Input

The first line contains three space-separated integers 2n, x and y (2 ≤ 2n ≤ 100, 1 ≤ x, y ≤ 2n), representing the length of a square's side and the coordinates of the marked cell. It is guaranteed that 2n is even.

The coordinates of the marked cell are represented by a pair of numbers x y, where x represents the number of the row and y represents the number of the column. The rows and columns are numbered by consecutive integers from 1 to 2n. The rows are numbered from top to bottom and the columns are numbered from the left to the right.

Output

If the square is possible to cut, print "YES", otherwise print "NO" (without the quotes).

Examples

Input

4 1 1


Output

YES


Input

2 2 2


Output

NO

Note

A sample test from the statement and one of the possible ways of cutting the square are shown in the picture: 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long LLINF = 1e18;
const int INF = INT_MAX;
const long double PI = acos(-1);
const long double E = 2.71828183;
const int MOD = 1e9 + 7;
template <typename T>
struct segment_tree {
  vector<T> tree;
  int size;
  T DEF;
  void init(int n) {
    size = 1;
    DEF = INF;
    while (size < n) size *= 2;
    tree = vector<T>(2 * size, 0);
  }
  T merge(T a, T b) { return a + b; }
  void set(int i, int x, T v, int lx, int rx) {
    if (rx - lx == 1) {
      tree[x] = v;
      return;
    }
    int m = (rx + lx) / 2;
    if (i < m) {
      set(i, 2 * x + 1, v, lx, m);
    } else {
      set(i, 2 * x + 2, v, m, rx);
    }
    tree[x] = merge(tree[2 * x + 1], tree[2 * x + 2]);
  }
  void set(int i, T v) { set(i, 0, v, 0, size); }
  T sum(int l, int r, int x, int lx, int rx) {
    if (r <= lx || rx <= l)
      return 0;
    else if (l <= lx && rx <= r)
      return tree[x];
    int m = (lx + rx) / 2;
    return merge(sum(l, r, 2 * x + 1, lx, m), sum(l, r, 2 * x + 2, m, rx));
  }
  T sum(int l, int r) { return sum(l, r + 1, 0, 0, size); }
  void print_tree() {
    for (int i = 0; i < tree.size(); i++) cout << to_string(tree[i]) << " ";
    cout << "\n";
  }
};
vector<int> bfs(vector<vector<int> > adj, int src) {
  queue<int> q;
  vector<int> d(adj.size(), INF);
  q.push(src);
  d[src] = 0;
  while (!q.empty()) {
    int c = q.front();
    q.pop();
    for (int nbr : adj[c]) {
      if (d[nbr] == INF) q.push(nbr);
      d[nbr] = min(d[nbr], d[c] + 1);
    }
  }
  return d;
}
template <typename T>
void read(vector<T>& v) {
  int n = v.size();
  for (int i = 0; i < n; i++) cin >> v[i];
}
long double log(long double a, long double b) { return log(b) / log(a); }
long long power(long long base, long long exp, long long M = LLONG_MAX) {
  long long res = 1;
  while (exp) {
    if (exp % 2 == 1) res = ((res % M) * (base % M)) % M;
    base = ((base % M) * (base % M)) % M;
    exp /= 2;
  }
  return res;
}
string to_base(int n, int new_base) {
  string s;
  int nn = n;
  while (nn) {
    s += to_string(nn % new_base);
    nn /= new_base;
  }
  reverse(s.begin(), s.end());
  return s;
}
long long gcd(long long a, long long b) {
  if (a % b == 0)
    return b;
  else
    return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
bitset<(const int)(5e5)> sieve() {
  bitset<(const int)(5e5)> ans;
  for (int i = 2; i < 5e5; i++) ans[i] = 1;
  for (int i = 2; i * i < 5e5; i++) {
    if (ans[i])
      for (int j = 2 * i; j < 5e5; j += i) ans[j] = 0;
  }
  return ans;
}
void solve();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) solve();
  return 0;
}
void solve() {
  int n, x, y;
  cin >> n >> x >> y;
  if (n <= 2 ||
      ((x == n / 2 || x == n / 2 + 1) && (y == n / 2 || y == n / 2 + 1))) {
    cout << "NO"
         << "\n";
    return;
  }
  {
    cout << "YES"
         << "\n";
    return;
  }
}