制約

入力

出力

入力例 1

出力例 1

Yes

AさんとBさんは直接会話可能です。また、BさんとCさんも直接会話可能です。従って Yes を出力してください。

入力例 2

100 10 1 2

出力例 2

No

この場合は不可能です。

入力例 3

10 10 10 1

出力例 3

Yes

複数人が同じ場所にいることもあります。

入力例 4

1 100 2 10

出力例 4

Yes

Score : 100 points

Problem Statement

Three people, A, B and C, are trying to communicate using transceivers.
They are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.
Two people can directly communicate when the distance between them is at most d meters.
Determine if A and C can communicate, either directly or indirectly.
Here, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.

Constraints

1≤a,b,c≤100

1≤d≤100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

abcd

Output

If A and C can communicate, print Yes; if they cannot, print No.

Sample Input 1

4 7 9 3

Sample Output 1

Yes

A and B can directly communicate, and also B and C can directly communicate, so we should print Yes.