Score: $100$ points

问题陈述

AtCoder 铁路线有 $N$ 个车站，编号为 $1, 2, \ldots, N$。

在这条线路上，有 进站列车 从车站 $1$ 开始，按顺序停在车站 $2, 3, \ldots, N$，还有 出站列车 从车站 $N$ 开始，按顺序停在车站 $N - 1, N - 2, \ldots, 1$。

高桥即将使用其中一列进站或出站列车，从车站 $X$ 旅行到车站 $Y$。

确定在这次旅行中，列车是否会在车站 $Z$ 停靠。

以上为大语言模型 kimi 翻译，仅供参考。

Problem Statement

The AtCoder railway line has $N$ stations, numbered $1, 2, \ldots, N$.

On this line, there are inbound trains that start at station $1$ and stop at the stations $2, 3, \ldots, N$ in order, and outbound trains that start at station $N$ and stop at the stations $N - 1, N - 2, \ldots, 1$ in order.

Takahashi is about to travel from station $X$ to station $Y$ using only one of the inbound and outbound trains.

Determine whether the train stops at station $Z$ during this travel.

Constraints

• $3 \leq N \leq 100$
• $1 \leq X, Y, Z \leq N$
• $X$, $Y$, and $Z$ are distinct.
• All input values are integers.

Input

The input is given from Standard Input in the following format:

$N$ $X$ $Y$ $Z$

Output

If the train stops at station $Z$ during the travel from station $X$ to station $Y$, print Yes; otherwise, print No.

Sample Input 1

7 6 1 3

Sample Output 1

Yes

To travel from station $6$ to station $1$, Takahashi will take an outbound train.

After departing from station $6$, the train stops at stations $5, 4, 3, 2, 1$ in order, which include station $3$, so you should print Yes.

Sample Input 2

10 3 2 9

Sample Output 2

No

Sample Input 3

100 23 67 45

Sample Output 3

Yes