p03075 AtCoder Beginner Contest 123 - Five Antennas_32049
In AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.
Two antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.
Determine if there exists a pair of antennas that cannot communicate directly.
Here, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.

Constraints

* a, b, c, d, e and k are integers between 0 and 123 (inclusive).
* a < b < c < d < e

Input

Input is given from Standard Input in the following format:


a
b
c
d
e
k


Output

Print `:(` if there exists a pair of antennas that cannot communicate directly, and print `Yay!` if there is no such pair.

Examples

Input

1
2
4
8
9
15


Output

Yay!


Input

15
18
26
35
36
18


Output

:(
#include<bits/stdc++.h>
using namespace std;
int main()
{
	int a[5],k;
	for(int i=0;i<5;i++) cin>>a[i];
	cin>>k;
	int x=a[4]-a[0];
	if(x<=k) cout<<"Yay!";
	else cout<<":(";
	return 0;
}