Problem:
 ﻿Score: 100 points    Problem Statement  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.        Sample Input 1 1
2
4
8
9
15      Sample Output 1 Yay!  In this case, there is no pair of antennas that cannot communicate directly, because:   the distance between A and B is 2 - 1 = 1  the distance between A and C is 4 - 1 = 3  the distance between A and D is 8 - 1 = 7  the distance between A and E is 9 - 1 = 8  the distance between B and C is 4 - 2 = 2  the distance between B and D is 8 - 2 = 6  the distance between B and E is 9 - 2 = 7  the distance between C and D is 8 - 4 = 4  the distance between C and E is 9 - 4 = 5  the distance between D and E is 9 - 8 = 1   and none of them is greater than 15 . Thus, the correct output is Yay! .       Sample Input 2 15
18
26
35
36
18      Sample Output 2 :(  In this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18 , so they cannot communicate directly.
Thus, the correct output is :( .

Solution (Python):
list = []
for i in range(6):
    list.append(int(input()))

x = list[:5]
k = list[5]
err = False

for i, x1 in enumerate(x):
    for j, x2 in enumerate(x[i+1:]):
        if abs(x1-x2)>k:
            err = True

if err:
    print(":(")
else:
    print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a <= k:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
l = [a,b,c,d,e]
if (max(l) - min(l)) > k:
  print(':(')
else:
  print('Yay!')

Solution (Python):

xs = [int(input()) for _ in range(5)]
k = int(input())

ok = True
for x in xs:
    for y in xs:
        if abs(x-y) > k:
            ok = False

print("Yay!" if ok else ":(")

Solution (Python):
a=int(input())
input()
input()
input()
e=int(input())
k=int(input())
if e - a <= k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
ans = True
if b - a > k:
    ans = False
if c - a > k:
    ans = False
if d - a > k:
    ans = False
if e - a > k:
    ans = False
if c - b > k:
    ans = False
if d - b > k:
    ans = False
if e - b > k:
    ans = False
if d - c > k:
    ans = False
if e - c > k:
    ans = False
if e - d > k:
    ans = False
if ans:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
if e-a>k:
  print(":(")
else:
  print("Yay!")

Solution (Python):

import sys


def get_num():
    return int(input())


def get_nums(n):
    res = [0 for _ in range(n)]
    for i in range(n):
        res[i] = int(input())
    return res


def get_numbers():
    return map(int, input().split())


antennas = get_nums(5)
k = get_num()

if antennas[-1] - antennas[0] > k:
    print(':(')
else:
    print('Yay!')

Solution (Python):
li = [int(input()) for i in range(6)]
print("Yay!" if li[4]-li[0] <= li[5] else ":(")

Solution (Python):
cnt = 0
*ant_locs, k = [int(input()) for _ in range(6)]
for idx_i, loc_i in enumerate(ant_locs):
    for idx_j, loc_j in enumerate(ant_locs):
        if idx_j >= idx_i:
            break
        if abs(loc_i - loc_j) > k:
            cnt += 1
            
print("Yay!" if cnt == 0 else ":(")

Solution (Python):
a,b,c,d,e,k = [int(input()) for i in range(6)]
print("Yay!" if e-a<=k else ":(")

Solution (Python):
a_arr = []
a_arr.append(int(input()))
a_arr.append(int(input()))
a_arr.append(int(input()))
a_arr.append(int(input()))
a_arr.append(int(input()))
k = int(input())

d = a_arr[4]-a_arr[0]

if d<=k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
d = list(int(input()) for i in range(5))
k = int(input())
ans = 'Yay!'
for i in range(4):
    for j in range(4-i):
        if d[4-j] - d[i] > k:
            ans = ':('

print(ans)

Solution (Python):
N = [int(input()) for i in range(6)] 
count = 0
for i in range(5):
  for j in range(5):
    if abs(N[i]-N[j]) > N[5]:
      count += 1

if count == 0:
  print("Yay!")
else:
  print(":(")

Solution (Python):
place = [int(input()) for _ in range(5)]
k = int(input())
bomb = 0
for p in range(len(place) - 1):
  for p_dash in range(p, len(place)):
    if place[p_dash] - place[p] > k:
      bomb += 1
      break
if bomb == 0:
  print('Yay!')
else:
  print(':(')

Solution (Python):
antenna = []
for i in range(5):
  antenna.append(int(input()))
k = int(input())
if k >= max(antenna) - min(antenna):
  print("Yay!")
else:
  print(":(")

Solution (Python):
n=[int(input()) for _ in range(5)]
k=int(input())
ans=0
for i in range(len(n)):
  for j in range(len(n)):
    if abs(n[i]-n[j]) > k:
      ans+=1

if ans==0:
  print('Yay!')
else:
  print(':(')

Solution (Python):

A = [0, 0, 0, 0, 0]
A[0] = int(input())
A[1] = int(input())
A[2] = int(input())
A[3] = int(input())
A[4] = int(input())
k = int(input())

flg = 0

for i in range(0, 4, 1):
    if flg == 1:
        break

    for j in range(i+1, 5, 1):
        if k < (A[j] - A[i]):
            flg = 1
            print(":(")
            break

if flg == 0:
    print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a > k:
    print(":(")
else:
    print("Yay!")

Solution (Python):
"""


 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())


 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  


a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 
"""

import math
import sys
import itertools
import queue
from fractions import gcd

def lcm(a, b):
    return a * b // gcd(a, b)

mod = 1000000007

if __name__ == "__main__":
    a= int(sys.stdin.readline())
    b= int(sys.stdin.readline())
    c= int(sys.stdin.readline())
    d= int(sys.stdin.readline())
    e= int(sys.stdin.readline())
    k= int(sys.stdin.readline())

    if e-a <= k:
        print("Yay!")
    else:
        print(":(")

Solution (Python):
a,b,c,d,e,k = [int(input()) for i in range(6)]

if e-a<=k:
  print("Yay!")
else:
  print(":(")

Solution (Python):
li = list(int(input()) for i in range(5))

k = int(input())

li1 = [(x - y) for x in li for y in li if x>y]

if all(li1[i]<=k for i in range(len(li1))):
    print("Yay!")
else:
    print(":(")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a <= k:
  print('Yay!')
else:
  print(':(')

Solution (Python):
X = [int(input()) for _ in range(5)]
k = int(input())
for i in range(4):
    for j in range(i + 1, 5):
        if abs(X[i] - X[j]) > k:
            print(":(")
            exit()
print("Yay!")

Solution (Python):
antennas = []

for _ in range(5):
    antenna = int(input())
    antennas.append(antenna)

k = int(input())
    
if ((antennas[4] - antennas[0]) <= k):
    print("Yay!")
else:
    print(":(")

Solution (Python):
ant = [int(input()) for i in range (5)]
k=int(input())
if max(ant) - min(ant) <= k:print("Yay!")
else:print(":(")

Solution (Python):
a=[int(input()) for i in range(5)]
k=int(input())
if abs(a[0]-a[4])>k:
  print(":(")
else:
  print("Yay!")

Solution (Python):
n = []
for i in range(5):
    n.append(int(input()))
k = int(input())
if max(n) - min(n) <= k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a = []
for i in range(5):
    a.append(int(input()))

k = int(input())

if max(a) - min(a) > k:
    print(':(')
else:
    print('Yay!')

Solution (Python):

a=[]
ans="Yay!"
for _ in range(6):
  a.append(int(input()))
for i in range(5):
  for j in range(i+1,5):
    if abs(a[i]-a[j])>a[5]:
      ans=":("
      break
print(ans)

Solution (Python):



l = list()
for _ in range(5):
    l.append(int(input()))
k = int(input())


ans = True
for i in range(len(l)):
    for j in range(len(l) - i):
        if l[j] - l[i] > k:
            ans = False


print('Yay!' if ans else ':(')

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a > k:
    print(":(")
    exit()
print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a > k:
    print(":(")
    exit()
if d - a > k:
    print(":(")
    exit()
if c - a > k:
    print(":(")
    exit()
if b - a > k:
    print(":(")
    exit()

print("Yay!")

Solution (Python):
a = [int(input()) for i in range(5)]
k = int(input())
if a[-1] - a[0] > k:
    print(":(")
else:
    print("Yay!")

Solution (Python):
a = []
for i in range(5):
    a.append(int(input()))
k = int(input())

if a[-1]-a[0] > k:
    out = ":("
else:
    out = "Yay!"
    
print(out)

Solution (Python):

a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e-a > k:
  print(":(")
else:
  print("Yay!")

Solution (Python):
a = int(input())
[input() for i in range(3)]
e = int(input())
print('Yay!' if e - a <= int(input()) else ':(')

Solution (Python):
li = [int(input()) for _ in range(5)]
k = int(input())

if k >=  li[-1] - li[0]:
    print("Yay!")
else:
    print(":(")

Solution (Python):
L = [int(input()) for _ in range(5)]
L.sort()
k = int(input())
print(":(" if L[-1]-L[0] > k else "Yay!")

Solution (Python):
input = open(0).read
a, b, c, d, e, k = map(int, input().split())
print("Yay!" if max(a, b, c, d, e) - min(a, b, c, d, e) <= k else ":(")

Solution (Python):
tmp = []
flg=0
for i in range(5):
  tmp.append(int(input()))
k = int(input())

if tmp[4]-tmp[0] > k:
  print(':(')
else: print('Yay!')

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a > k:
	print(":(")
else:
	print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a > k:
    print(':(')
else:
    print('Yay!')

Solution (Python):

a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
"""
AB = b - a
AC = c - a
AD = d - a
AE = e - a
BC = c - b
BD = d - b
BE = e - b
CD = d - c
CE = e - c
DE = e - d
if AB <= k and AC <= k and AD <= k and AE <= k and BC <= k and BD <= k and BE <= k and CD <= k and CE <= k and DE <= k:
    print("Yay!")
else:
    print(":(s")
"""
if e - a > k:
    print(":(")
else:
    print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
l = [
    b - a, c - a, d - a, e - a, c - b, d - b, e - b, d - c, e - c, e - d
]

for i in l:
    if i > k:
        print(":(")
        break
else:
    print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
num = [a,b,c,d,e]
flag = 0
for i in range(4):
    for j in range(i+1,5):
        if num[j] - num[i] > k:
            flag = 1
            break
    if flag == 1:
        break
if flag == 1:
    print(":(")
else:
    print('Yay!')

Solution (Python):
a,b,c,d,e,k=[int(input()) for _ in range(6)]
if e-a>k:
    print(':(')
else:
    print('Yay!')

Solution (Python):
lst = []
for i in range(0, 5):
	lst.append(int(input()))
K = int(input())
lst.sort(reverse = True)
ans = 'Yay!'
for i in range(0, 5):
	for j in range(i+1, 5):
		if lst[i] - lst[j] > K:
			ans = ':('
print(ans)

Solution (Python):
import itertools
dis = [int(input()) for _ in range(5)]
k = int(input())

comb_dis = list(itertools.combinations(dis, 2))

for i in range(5):
    if abs(comb_dis[i][1] - comb_dis[i][0]) > k:
        print(":(")
        exit()


print("Yay!")

Solution (Python):
a = [int(input()) for i in range(5)]

a.sort()
k = a[4]-a[0]
b = int(input())
if k <= b:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a = [int(input()) for i in range(5)]
b = int(input())
for i in range(5):
    for j in range(5):
        if a[j] - a[i] > b:
            print(":(")
            exit()
print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a > k:
  print(':(')
else:
  print('Yay!')

Solution (Python):
a = [0]*5
for i in range(5):
    a[i] = int(input())
k = int(input())

flag = True
for j in range(5):
    for l in range(j+1, 5):
        if abs(a[j] - a[l]) > k:
            flag = False

if flag:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

lst = [a, b, c, d, e]
cnt = 0

for i in range(0, 4):
    for j in range(i, 5):
        if (lst[j] - lst[i]) > k:
            cnt += 1

print(":(") if cnt > 0 else print("Yay!")

Solution (Python):
import sys
input = sys.stdin.readline
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a <= k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
A = [int(input()) for _ in range(5)]
k = int(input())
print("Yay!" if max(A) - min(A) <= k else ":(")

Solution (Python):
s=[int(input()) for _ in range(5)]
s.sort()
print('Yay!' if s[-1]-s[0]<=int(input()) else ':(')

Solution (Python):
info=[]
for i in range(6):
    info.append(int(input()))
if info[4]-info[0]<=info[5]:
    print("Yay!")
else:
    print(":(")

Solution (Python):
def main():
    a = int(input())
    b = int(input())
    c = int(input())
    d = int(input())
    e = int(input())
    k = int(input())
    if e - a <= k:
        print('Yay!')
    else:
        print(':(')


main()

Solution (Python):
loc=[]
for i in range(5):
  a=int(input())
  loc.append(a)
k=int(input())
for i in range(5):
  for j in range(5):
    if loc[j]-loc[i]>k:
      print(':(')
      exit()
print('Yay!')

Solution (Python):
a = input()
b = input()
c = input()
d = input()
e = input()
f = input()
x = e - a
if f < x:
    print ":("
else:
    print "Yay!"

Solution (Python):
def main():

    """ convenient functions
    
    
    
    
    """

    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    from operator import itemgetter
    
    
    from functools import reduce
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)

    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))
    Rmap = lambda: map(int, r().split())

    """ how to treat input
    
    
    
    
    
    
    
    """

    if __name__ != '__main__':
        
        sys.stdin = open('sample.txt')

    
    
    abcde = [int(r()) for _ in range(5)]
    k = int(r())
    for i in abcde:
        for j in abcde:
            if abs(i-j) > k:
                print(":(")
                exit()
    print("Yay!")
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """

if __name__ == '__main__':
    main()

Solution (Python):
a = [int(input()) for _ in range(5)]
k = int(input())
m = 0
for ai in a:
  for aj in a:    
    if m < abs(ai - aj):
      m = abs(ai - aj)
if m <= k:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a <= k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e - a <= k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
from itertools import combinations as comb

z_list = []
for i in range(5):
    z = int(input())
    z_list.append(z)
k = int(input())

z_comb_list = list(comb(z_list, 2))

flag = True
for comb in z_comb_list:
    if abs(comb[0] - comb[1]) > k:
        print(":(")
        flag = False
        break

if flag:
    print("Yay!")

Solution (Python):
ant=[]
for i in range(5):
    ant.append(int(input()))
k=int(input())

dis=sorted(ant)
print("Yay!" if dis[-1]-dis[0]<=k else ":(")

Solution (Python):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())

if e-a>k:
	print(":(")
else:
	print("Yay!")

Solution (Python):
antena = []
for _ in range(5):
    antena.append(int(input()))
k = int(input())
if antena[4]-antena[0] <= k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
def resolve():
	a=int(input())
	b=int(input())
	c=int(input())
	d=int(input())
	e=int(input())
	k=int(input())
	if e-a<=k:
		print('Yay!')
	else:
		print(':(')
resolve()

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

line = [a, b, c, d, e]

ans = 0
for i in range(5):
    for j in range(5):
        if abs(line[i] - line[j]) > k:
            ans += 1
            break

if ans >= 1:
    print(":(")
else:
    print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e-a <= k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
def main():
    antenna = []
    for i in range(5):
        antenna.append(int(raw_input()))
    k = int(raw_input())
    if (antenna[-1] - antenna[0]) <= k:
        print("Yay!")
    else:
        print(":(")



if __name__ == "__main__":
    main()

Solution (Python):
a = [int(input())for i in range(5)]
b = int(input())
for i in range(5):
    for j in range(5):
        if i != j:
            if i < j:
                if a[j] - a[i] > b:
                    print(":(")
                    exit()
            else:
                if a[i] - a[j] >  b:
                    print(":(")
                    exit()
print("Yay!")

Solution (Python):
L = [int(input()) for _ in range(5)]
k = int(input())

import itertools
flag = True
for i in itertools.permutations(range(5), 2):
    if i[0] < i[1]:
        if L[i[1]] - L[i[0]] > k:
            flag = False
if flag:
    print('Yay!')
else:
    print(':(')

Solution (Python):
A=list(int(input()) for _ in range(5))
k=int(input())
if (A[-1]-A[0])>k:
    print(':(')
else:
    print('Yay!')

Solution (Python):
lst = [0]*5
for i in range(5):
    lst[i] = int(input())

k = int(input())

if max(lst) - min(lst) > k:
    print(':(')
else:
    print('Yay!')

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if (e-a) > k:
  print(":(")
else:
  print("Yay!")

Solution (Python):
def A(n,m,k):
    if k >= abs(n - m):
        return True
    else:
        return False

lst = list(map(int,list([input() for i in range(6)])))
k = lst[-1]
r = [A(i,j,k) for j in lst[:5] for i in lst[:5]]
if False not in r:
    print("Yay!")
else:
    print(":(")

Solution (Python):






a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())


if (e-a)>k or (e-b)>k or (e-c)>k or (e-d)>k or (d-a)>k or (d-b)>k or (d-c)>k or (c-a)>k or (c-b)>k or (b-a)>k:
    print(':(')
    
else:
    print('Yay!')

Solution (Python):

a, b, c, d, e, k = [int(input()) for _ in range(6)]

if e - a > k:
	print(":(")
else:
	print("Yay!")

Solution (Python):
ant = [int(input()) for i in range (5)]
k=int(input())
if max(ant) - min(ant) <= k:print("Yay!")
else:print(":(")

Solution (Python):
l = [int(input()) for i in range(5)]
k = int(input())
if max(l)-min(l) <= k:
  print('Yay!')
else:
  print(':(')

Solution (Python):
l = [int(input()) for i in range(5)]
k = int(input())

c = 0

for i in range(len(l)):
    for j in range(len(l)):
        if l[i] - l[j] > k:
            c += 1
            
if c == 0:
    print('Yay!')
else:
    print(':(')

Solution (Python):
antenna = [int(input()) for i in range(5)]
k = int(input())
antenna.sort()
if antenna[4] - antenna[0] > k:
    print(":(")
else:
    print("Yay!")

Solution (Python):
dis = []
for i in range(6):
  dis.append(int(input()))

if dis[4] - dis[0] <= dis[5]:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a = [int(input()) for i in range(5)]
b = int(input())
c = sorted(a)

if c[4]-c[0]<=b:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

distance = [b - a, c - a, d - a, e - a, c - b, d - b, e - b, d - c, e - c, e - d]
for i in range(10):
  if k < distance[i]:
    print(":(")
    exit()
print("Yay!")

Solution (Python):
import itertools

li = [int(input()) for _ in range(5)]
k = int(input())

res = itertools.combinations(li,2)


for i,j in res:
    if j - i <= k:
        pass
    else:
        print(":(")
        exit()

print("Yay!")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e - a <= k:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
if e-a>k:
  print(":(")
else:
  print("Yay!")

Solution (Python):
antenas = [int(input()) for i in range(5)]

k = int(input())

if (antenas[4] - antenas[0]) <= k:
  print("Yay!")
else :
  print(":(")

Solution (Python):
def main():
    input_data = [int(input()) for i in range(5)]
    k = int(input())

    input_data.sort()
    input_data.reverse()

    temp = input_data[0] - input_data[4]
    if temp > k :
        print(":(")
    else:
        print('Yay!')

if __name__ == '__main__':
    main()

Solution (Python):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

def main():
    a = [0] * 5
    for i in range(5):
        a[i] = INT()
    K = INT()
    if a[-1] - a[0] <= K:
        print('Yay!')
    else:
        print(':(')

if __name__ == '__main__':
    main()

Solution (Python):
lst = [int(input()) for i in range(5)]
k = int(input())
if (max(lst)-min(lst)) <= k:
    print('Yay!')
else:
    print(':(')

Solution (Python):

a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a <= k:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a = input()
b = input()
c = input()
d = input()
e = input()
k = input()
a = int(a)
b = int(b)
c = int(c)
d = int(d)
e = int(e)
k = int(k)
if(abs(a-b)>k or abs(a-c)>k or abs(a-d)>k or abs(a-e)>k or abs(b-c)>k or abs(b-d)>k or abs(b-e)>k or abs(c-d)>k or abs(c-e)>k or abs(d-e)>k):
	print(":(")
else:
	print("Yay!")

Solution (Python):
l = [int(input()) for i in range(6)]
if l[4] - l[0] <= l[5]:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a = int(input())
input()
input()
input()
e = int(input())
k = int(input())
print("Yay!" if e-a <= k else ":(")

Solution (Python):
nums = [int(input()) for _ in range(6)]
if (nums[4]-nums[0])<=nums[5]:
    print("Yay!")
else:
    print(":(")

Solution (Python):
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
K = int(input())
a = abs(A-B)
b = abs(A-C)
c = abs(A-D)
d = abs(A-E)
e = abs(B-C)
f = abs(B-D)
g = abs(B-E)
h = abs(C-D)
i = abs(C-E)
j = abs(D-E)
if a<=K and b<=K and c<=K and d<=K and e<=K and f<=K and g<=K and h<=K and i<=K and j<=K:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if e-a > k:
    print(":(")
else:
    print("Yay!")

Solution (Python):



LI = [int(input()) for _ in range(6)]
K = LI[-1]

for i in range(1,5):
    for j in range(i):
        if LI[i] - LI[j] > K:
            print(':(')
            exit()
print('Yay!')

Solution (Python):
s = []
i = 0
for i in range(6):
    s.append(input())

s = [int(j) for j in s]

if s[4]-s[0] <= s[5]:
    print("Yay!")
else:
    print(":(")

Solution (Python):
from sys import stdin

x = []
x.append(int(stdin.readline().rstrip()))
x.append(int(stdin.readline().rstrip()))
x.append(int(stdin.readline().rstrip()))
x.append(int(stdin.readline().rstrip()))
x.append(int(stdin.readline().rstrip()))

k = int(stdin.readline().rstrip())

flag = 0
for i in range(1,5):
    for j in range(0,i):
        if abs(x[i] - x[j]) > k:
            flag = 1

if flag == 0:
    print("Yay!")
else:
    print(":(")

Solution (Python):
A=[]
for i in range(6):
  A.append(int(input()))
if A[4]-A[0]<=A[5]:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a = [int(input()) for i in range(6)]
if max(a[:5])-min(a[:5])<=a[5]:
  print('Yay!')
else:
  print(':(')

Solution (Python):
s = []
for _ in range(5):
    s.append(int(input()))

k = int(input())

s_min = min(s)
s_max = max(s)

if s_max - s_min > k:
    print(":(")
else:
    print("Yay!")

Solution (Python):
x = [int(input()) for _ in range(6)]
print(':(' if x[-2]-x[0] > x[-1] else 'Yay!')

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if k>=b-a and k>=c-a and k>=d-a and k>=e-a and k>=c-b and k>=d-b and k>=e-b and k>=d-c and k>=e-c and k>=e-d:
  print("Yay!")
else:
  print(":(")