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):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if k >= max([a, b, c, d, e]) - min([a, b, c, d, e]):
    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):
import sys
input = sys.stdin.readline

a = [int(input()) for i in range(5)]
k = int(input())

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

Solution (Python):


a = int(input())
b = input()
c = input()
d = 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('Yay!')
else:
    print(':(')

Solution (Python):
if __name__ == "__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(":(")

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()) for _ in range(5)]
k = int(input())
if max(a) - min(a) > k:
    print(':(')
else:
    print('Yay!')

Solution (Python):


a = [int(input()) for _ in range(5)]
k = int(input())
flag = True

for i in range(5):
  for j in range(5):
    if abs(a[i] - a[j]) > k:
      flag = False
      break

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())
print(':(' if k < e - a else '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 max([a, b, c, d, e]) - min([a, b, c, d, e]) > 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()) for i in range(5)]
k = int(input())

ans = "Yay!"

if A[-1] - A[0] > k :
    ans = ":("
print(ans)

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

a.sort()

k = int(input())

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

Solution (Python):

from sys import stdin


s_in = lambda: stdin.readline()[:-1]  
d_in = lambda: int(stdin.readline())  
ds_in = lambda: list(map(int, stdin.readline().split()))  


points = []
for _ in range(5):
    points.append(d_in())
k = d_in()

max_dist = -1
for i in range(5):
    for j in range(i+1, 5):
        max_dist = max(max_dist, abs(points[i] - points[j]))

if max_dist <= k:
    print('Yay!')
else:
    print(':(')

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

k = int(input())

ans = 0
for i in z:
    for j in z:
        if i >= j:
            continue
        if j - i > k:
            ans += 1

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

Solution (Python):
import sys
input = sys.stdin.readline
a = [0,0,0,0,0]
for i in range(5):
    a[i] = int(input())
k = int(input())
if a[4] - a[0] > k:
    print(":(")
else:
    print("Yay!")

Solution (Python):
arr = [int(input()) for _ in range(6)]
if arr[4] - arr[0] > arr[5]:
  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())

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    a = IR(5)
    k = II()
    if max(a) - min(a) > k:
        print(":(")
    else:
        print("Yay!")
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

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):
num = [int(input()) for _ in range(5)]
k = int(input())

num.sort()
diff = num[4] - num[0]

if diff > k:
    print(":(")
else:
    print("Yay!")

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

Solution (Python):
def solve():
    a=[0]*5
    for i in range(5):
        a[i]=int(input())
    k=int(input())
    if a[4]-a[0]<=k:
        return 'Yay!'
    else:
        return ':('

print(solve())

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

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

Solution (Python):
abcde=[int(input()) for i in range(5)]
k=int(input())
if max(abcde)-min(abcde)>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("Yay!")
else:
    print(":(")

Solution (Python):
import sys






"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        
        
        
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)


"""ここからメインコード"""


def main():
    
    r, e, p = range, enumerate, print
    ip = IP()
    id = Idea()
    mod = 10 ** 9 + 7

    """この下から書いてね"""
    li = ip.ILS(5)
    k = ip.I()
    if max(li) - min(li) <= k:
        p("Yay!")
    else:
        p(":(")


main()

Solution (Python):

import atexit
import io
import sys

buff = io.BytesIO()
sys.stdout = buff


@atexit.register
def write():
    sys.__stdout__.write(buff.getvalue())

l = []
for i in xrange(5):
	l.append(input())
k = input()
ans = 'Yay!'
for i in xrange(5):
	for j in xrange(5):
		if abs(l[i]-l[j]) > k:
			ans = ':('
print ans

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 math
import sys

a=[int(input()) for i in range(5)]
k=int(input())

for i in range(5):
        for j in range(5):
                if a[i]-a[j]>k:
                        print(":(")
                        sys.exit()

print("Yay!")

Solution (Python):
a=int(input())
s=int(input())
d=int(input())
f=int(input())
g=int(input())
h=int(input())
if g-a>h:
  print(":(")
else:
  print("Yay!")

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

k = int(input())

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

Solution (Python):
ps, k = [int(input()), int(input()), int(input()), int(input()), int(input())], int(input())
f = True
for i in range(0, 5):
    for j in range(0, 5):
        if ps[j] - ps[i] > k:
            f = False
print('Yay!' if f else ':(')

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

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

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

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

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

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(":(")
    else:
        print("Yay!")

main()

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

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

print(':(' if max(a)-min(a)>k else '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())

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

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

bl = True
for ee1 in e:
    for ee2 in e:
        if abs(ee1 - ee2) > k:
            bl = False
            break
    if not bl:
        break
print('Yay!' if bl else ':(')

Solution (Python):
q = [int(input()) for i in range(5)]
k = int(input())
for i in range(5):
    for j in range(i,5):
        if abs(q[i]-q[j]) > k:
            print(":(")
            exit()

print("Yay!")

Solution (Python):
def int_raw():
    return int(input())


def ss_raw():
    return input().split()


def ints_raw():
    return list(map(int, ss_raw()))


a = int_raw()
b = int_raw()
c = int_raw()
d = int_raw()
e = int_raw()
k = int_raw()

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

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

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

  
solve()

Solution (Python):
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit

import heapq
import itertools
import operator



inf = float('inf')
N = 0


def set_inputs():
    global N
    return


def main():
    setrecursionlimit(100000)
    set_inputs()
    
    a = get_int()
    b = get_int()
    c = get_int()
    d = get_int()
    e = get_int()
    k = get_int()
    if abs(a - e) > k:
        print(":(")
    else:
        print("Yay!")
    return


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types, sep=None):
    if len(types) == 1:
        return [types[0](input()) for _ in range(n)]
    return list(zip(*(
        [t(x) for t, x in zip(types, input().split(sep=sep))]
        for _ in range(n)
    )))


if __name__ == '__main__':
    main()

Solution (Python):
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
print("Yay!" if e-a <= 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("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):
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())
if max(a)-min(a)>k: print(":(")
else: print("Yay!")

Solution (Python):
a,*_,e,k=map(int,open(0).read().split());print(':('*(e-a>k)or'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):
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18

A=rr(6)
k=A[-1]
if A[-2]-A[0] > k:
    print(":(")
else:
    print('Yay!')

Solution (Python):

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

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

abcde = [ni() for _ in range(5)]
k = ni()
if abcde[-1] - abcde[0] > k:
    print(":(")
else:
    print("Yay!")

Solution (Python):
X = [int(input()) for i in range(6)]
if X[4] - X[0] <= X[-1]:
    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 max(a,b,c,d,e) - min(a,b,c,d,e) > k:
    print(":(")
else:
    print("Yay!")

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

if max(a,b,c,d,e) - min(a,b,c,d,e) <= k:
  print "Yay!"
else:
  print ":("

Solution (Python):
l = [int(input()) for _ in range(5)]
k = int(input())
if l[4] - l[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,b,c,d,e,k=[int(input()) for _ in range(6)]
A=[a,b,c,d,e]
A.sort()
if abs(A[0]-A[-1])>k:
  print(':(')
else:
  print('Yay!')

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

Solution (Python):
A = [int(input()) for _ in range(5)]
k = int(input())
for i in range(5):
    for j in range(5):
        if abs(A[i] - A[j]) > k:
            print(':(')
            exit()
print('Yay!')

Solution (Python):

import sys
import itertools
import collections
import functools
import math
from queue import Queue

INF = float("inf")


def solve(a: int, b: int, c: int, d: int, e: int, k: int):
    if e-a > k:
        print(":(")
    else:
        print("Yay!")
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  
    b = int(next(tokens))  
    c = int(next(tokens))  
    d = int(next(tokens))  
    e = int(next(tokens))  
    k = int(next(tokens))  
    solve(a, b, c, d, e, k)


if __name__ == '__main__':
    main()

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    s = IR(5)
    k = I()
    if max(s)-min(s) > k:
        print(":(")
    else:
        print("Yay!")
    return


def B():
    n = I()
    return


def C():
    n = I()
    return


def D():
    n = I()
    return


if __name__ == "__main__":
    A()

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 itertools
import collections
import bisect

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(':(')

if __name__ == '__main__':
    main()

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