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 in Python (3.8.2) (judge verdict: Accepted)

# abc123_a.py
# https://atcoder.jp/contests/abc123/tasks/abc123_a

# ★ WA:2
# in2.txt
# in3.txt

# A - Five Antennas /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点: 100点

# 問題文
# AtCoder 市には、5つのアンテナが一直線上に並んでいます。
# これらは、西から順にアンテナ A,B,C,D,E と名付けられており、それぞれの座標は a,b,c,d,e です。
# 2 つのアンテナ間の距離が k 以下であれば直接通信ができ、k より大きいと直接通信ができません。
# さて、直接 通信ができないアンテナの組が存在するかどうか判定してください。
# ただし、座標 p と座標 q (p<q) のアンテナ間の距離は q−pであるとします。

# 制約
#     a,b,c,d,e,kは 0 以上 123以下の整数
#     a<b<c<d<e

# 入力
# 入力は以下の形式で標準入力から与えられる。
# a
# b
# c
# d
# e
# k


# 出力
# 直接 通信ができないアンテナの組が存在する場合は :(、存在しない場合は Yay! と出力せよ。

# 入力例 1
# 1
# 2
# 4
# 8
# 9
# 15

# 出力例 1
# Yay!

# この場合、直接通信できないアンテナの組は存在しません。なぜなら、
#     (A,B)の距離は 2−1 = 1
#     (A,C)の距離は 4−1 = 3
#     (A,D)の距離は 8−1 = 7
#     (A,E)の距離は 9−1 = 8
#     (B,C)の距離は 4−2 = 2
#     (B,D)の距離は 8−2 = 6
#     (B,E)の距離は 9−2 = 7
#     (C,D)の距離は 8−4 = 4
#     (C,E)の距離は 9−4 = 5
#     (D,E)の距離は 9−8 = 1

# そのように、全てのアンテナ間の距離が 15以下であるからです。
# よって、Yay! と出力すれば正解となります。

# 入力例 2
# 15
# 18
# 26
# 35
# 36
# 18

# 出力例 2
# :(

# この場合、アンテナ A
# と D の距離が 35−15 = 20 となり、18 を超えるため直接通信ができません。
# よって、:( と出力すれば正解となります。 


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # line = lines[0]
    # N = int(lines[0])
    # N, Q = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[1].split()))
    values = list()
    for i in range(5):
        values.append(int(lines[i]))
    # valueses = list()
    # for i in range(Q):
    #     valueses.append(list(map(int, lines[i+1].split())))

    log(f'lines[5]=[{lines[5]}]')

    for i in range(5):
        for j in range(5):
            log(f'values[i]=[{values[i]}], values[j]=[{values[j]}], lines[5]=[{lines[5]}]')
            log(f'abs(values[i] - values[j])=[{abs(values[i] - values[j])}], int(lines[5])=[{int(lines[5])}]')
            if abs(values[i] - values[j]) > int(lines[5]):
                return [':(']
    return ['Yay!']


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['1', '2', '4', '8', '9', '15']
        lines_export = ['Yay!']
    if pattern == 2:
        lines_input = ['15', '18', '26', '35', '36', '18']
        lines_export = [':(']
    if pattern == -1:
        lines_input = ['18', '19', '26', '35', '36', '18']
        lines_export = ['Yay!']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(6)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    if FLAG_LOG:
        log(f'lines_input=[{lines_input}]')
        log(f'lines_export=[{lines_export}]')
        log(f'lines_result=[{lines_result}]')
        if lines_result == lines_export:
            log('OK')
        else:
            log('NG')
    finished = time.time()
    duration = finished - started
    log(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()