Problem:
 Score: 100 points    Problem Statement  E869120's and square1001's 16 -th birthday is coming soon. Takahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.  E869120 and square1001 were just about to eat A and B of those pieces, respectively, when they found a note attached to the cake saying that "the same person should not take two adjacent pieces of cake".  Can both of them obey the instruction in the note and take desired numbers of pieces of cake?      Constraints   A and B are integers between 1 and 16 (inclusive).  A+B is at most 16 .         Input  Input is given from Standard Input in the following format:  A  B       Output  If both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay! ; otherwise, print :( .        Sample Input 1 5 4      Sample Output 1 Yay!  Both of them can take desired number of pieces as follows:       Sample Input 2 8 8      Sample Output 2 Yay!  Both of them can take desired number of pieces as follows:       Sample Input 3 11 4      Sample Output 3 :(  In this case, there is no way for them to take desired number of pieces, unfortunately.

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    A,B = map(int,input().split())
    if A <= 8 and B <= 8:
        print('Yay!')
    else:
        print(':(')
if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
print("Yay!" if a<9 and b<9 else ":(")

Solution (Python):
a,b=map(int,input().split())
if a>=9 or b>=9:
  print(":(")
else:
  print("Yay!")

Solution (Python):
print(':('*(len(s:=input())>3or'9'in s)or'Yay!')

Solution (Python):

a, b = map(int, input().split())
if a <= 8 and b <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a,b = map(int, input().split())
if (a<=8)&(b<=8):
    print("Yay!")
else:
    print(":(")

Solution (Python):
a, b = map(int, input().split())

if a <= 8 and b <= 8:
	print('Yay!')
else:
 	print(':(')

Solution (Python):
A, B = map(int, input().split())

if (A <= 8) and (B <= 8):
    print("Yay!")

else:
    print(":(")

Solution (Python):
a,b = map(int,input().split())
if(a<= 8)and(b<= 8):
    print("Yay!")
else:
    print(":(")

Solution (Python):


a, b = map(int, input().split())

if a <= 8 and b <=8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a, b = map(int, input().split())
print('Yay!' if max(a, b) <= 8 else ':(')

Solution (Python):
a,b = map(int,input().split())
if a <= 8 and b <= 8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10**9)
mod = 10**9+7

A,B = I()
if A > 8 or B > 8:
    print(':(')
else:
    print('Yay!')

Solution (Python):
A,B = map(int,input().split())

print("Yay!" if A<=8 and B<=8 else ":(")

Solution (Python):
a,b=map(int,input().split())
if a<9>b: print('Yay!')
else: print(':(')

Solution (Python):
a,b = map(int,input().split())
if a <= 8 and b <=  8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
A,B=map(int,input().split())
if A<=8 and B<=8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


def main():
    a, b = map(int, input().split())
    if a <= 8 and b <= 8: print("Yay!")
    else: print(":(")

if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split())
print(':('if a>8 or b>8else 'Yay!')

Solution (Python):
a,b = map(int,input().split())
if a<= 8 and b <= 8:
	print("Yay!")
else:
	print(":(")

Solution (Python):
a,b=map(int,input().split())
if a<=8 and b<=8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a,b= map(int,input().split())
print("Yay!" if a<=8 and b<=8 else ":(")

Solution (Python):
def main():
    A, B = map(int, input().split())
    if A > 8 or B > 8:
        print(':(')
    else:
        print('Yay!')
main()

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    A, B = map(int, input().split())

    if A <= 8 and B <= 8:
        ans = "Yay!"
    else:
        ans = ":("

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
if max(map(int,input().split()))<=8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a,b = map(int,input().split())

if max(a,b)<=8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
list = input().split()

if(int(list[0]) > 8 or int(list[1]) > 8):
  print(':(')
else:
  print('Yay!')

Solution (Python):
a,b = map(int,input().split())

if a<9 and b<9:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a,b=map(int,input().split())
if a<=8 and b<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a,b=map(int,input().split())
if a>8 or b>8:
  print(":(")
else:
  print("Yay!")

Solution (Python):
A,B=map(int,input().split())
if A<=8 and B<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a,b = map(int,input().split())
if a > 8 or b > 8:
    print(":(")
else:
    print("Yay!")

Solution (Python):
import numpy as np

a,b = map(int, input().split())
if(a<=8 and b<=8):
  print("Yay!")
else:
  print(":(")

Solution (Python):
a,b=map(int,input().split())
if abs(a-b)>2:
  print(':(')
else:
  print('Yay!')

Solution (Python):
A, B = map(int,input().split())

print('Yay!' if A <= 8 and B <= 8 else':(')

Solution (Python):
A,B = map(int,input().split())

if A > 8 or B > 8 :
    print(":(")
else:
    print("Yay!")

Solution (Python):
a,b=map(int,input().split())
if a <= 8 and b <= 8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
x,y = map(int,input().split())
if x<=8 and y<=8:print("Yay!")
else:print(":(")

Solution (Python):
x,y = map(int,input().split())
if x<=8 and y<=8:print("Yay!")
else:print(":(")

Solution (Python):
x,y = map(int,input().split())
if x<=8 and y<=8:print("Yay!")
else:print(":(")

Solution (Python):

for _ in range(1):
    n,k=[int(x) for x in input().split()]
    if n>8 or k>8:
        print(":(")
    else:
        print("Yay!")

Solution (Python):

import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter





j=0
k=0
n=3
r=1
a=[0]






"1行1つの整数を入力を取得し、整数と取得する"




"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"

















'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''


'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''
import itertools
from itertools import combinations_with_replacement

combinationについて
以下の違いを意識しよう
combinations() p, r 長さrのタプル列、ソートされた順で重複なし

combinations_with_replacement() p, r 長さrのタプル列、ソートされた順で重複あり


使用例 　　　　　　　　　　　                  出力　　
combinations('ABCD', 2)　　　　　　　　　　　　AB AC AD BC BD CD
combinations_with_replacement('ABCD', 2)　　 AA AB AC AD BB BC BD CC CD DD
'''



'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

'''
素数の判定
'''
def is_prime(n):
    if n == 1: return False

    for k in range(2, int(np.sqrt(n)) + 1):
        
        if n % k == 0:
            return False
            
    return True


'''
npのmaxとmaximumの違い
xs = np.array([1, -2, 3])
np.max(xs, 0)
この出力は3となります．[1, -2, 3]と0の4つの数字のうち，最も大きい値を出力します．

一方で，[max(1, 0), max(-2, 0), max(3, 0)]を出力したい時があります．
その時は，numpyのmaximum関数を用います．

xs = np.array([1, -2, 3])
np.maximum(xs, 0)  

'''

def factorial(x, mod=10**9+7):
    
    
    
    tmp = 1
    for i in range(1, x+1):
        tmp = (tmp * i) % mod
    return tmp
    '''
    Basically, when you do a**d % n, you actually have to calculate a**d, which could be quite large.
    But there are ways of computing a**d % n without having to compute a**d itself, and that is what pow does.
    '''
"
def gcd(a, b):
    while b:
        
        
        a, b = b, a % b
    return a

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

"
def divisor(n):
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table











'''
ascii_letters = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
digits = '0123456789'
hexdigits = '0123456789abcdefABCDEF'
letters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuv...\xaf\xb0...
lowercase = 'abcdefghijklmnopqrstuvwxyz'
octdigits = '01234567'
printable = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTU...
punctuation = '!"
uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
whitespace = '\t\n\x0b\x0c\r '
'''
'''
引数endに任意の文字列を指定すると、その文字列が改行の代わりに最後に挿入される。例えば連続するprint()の出力を改行なしで単純に連結したい場合は空文字列''を指定すればよい。

print('abc', end='---')
print('xyz')


print('abc', end='')
print('xyz')

source: print_basic.py
なお、デフォルトで改行されるのは引数endのデフォルト値が改行文字'\n'に設定されているから。
'''

def main():
    n=3
    steps=0
    state=0
    w=1
    j=0
    k=0
    
    
    
    a,b=map(int, input().split(" "))
    if a<=8 and b<=8:
        print("Yay!")
        sys.exit()
    print(":(")
    
    
    
    
    
    
    


    
    
     

    l = ['aaa', 'bbb', 'ccc']
    x=l.index('aaa')
    
    
    
    

    
        
    
    

    
    
    
    
    DP = np.zeros(w+1, dtype=int)
    exdp=np.zeros((3,4)) 
    
    
    
        
        
    
    
        
        
    


    
    



    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]
    

    ls = ["a", "b", "c", "d", "e"]


    
    

    
    

    
    
    
    
    
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
if a <= 8 and b <= 8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
A,B=map(int,input().split())
if A<=8 and B<=8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
A,B=map(int,input().split())
print("Yay!" if A<=8 and B<=8 else ":(")

Solution (Python):
a = list(map(int,input().split()))

if a[0] > 8 or a[1] > 8:
  print(":(")
else:
  print("Yay!")

Solution (Python):
a, b = map(int, input().split())
if a > 8 or b > 8:
    print(':(')
else:
    print('Yay!')

Solution (Python):
A, B = map(int, input().split())
print('Yay!' if (A * 2) <= 16 and (B * 2) <= 16 and A + B <= 16 else ':(')

Solution (Python):
a,b = map(int, input().split())

if a <= 8 and b <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a, b = map(int, input().split())
if a <= 8 and b <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
A, B = map(int, input().split())

if A > 8 or B > 8:
    print(":(")
else:
    print("Yay!")

Solution (Python):

A, B = map(int, input().split())

if abs(A - B) <= min(A, B):
    print("Yay!")
else:
    print(":(")

Solution (Python):
a,b = map(int,input().split())

if a <= 8 and b <= 8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
A, B = map(int, input().split())
ans = 'Yay!' if max(A, B) <= 8 else ':('
print(ans)

Solution (Python):
a, b = map(int,input().split())
print('Yay!') if a <= 8 and b <= 8 else print(':(')

Solution (Python):
a,b=map(int,input().split())
if a>8 or b>8:
    print(':(')
else:
    print('Yay!')

Solution (Python):
a,b=map(int,input().split())
if 8<max(a,b):
  print(":(")
else:
  print("Yay!")

Solution (Python):
a, b = map(int, input().split())

if a <= 8 and b <= 8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a,b = map(int,input().split())
if a>8 or b>8:
	print(":(")
else:
	print("Yay!")

Solution (Python):
a,b=map(int,input().split());print(':Y(a y !'[16-a-b>=max(a,b)-min(a,b)::2])

Solution (Python):
A, B = map(int, input().split())

if all([A < 9, B < 9]):
    print("Yay!")
else:
    print(":(")

Solution (Python):
print(":("if max(map(int,input().split()))>8 else "Yay!")

Solution (Python):
a,b = map(int,input().split())
if a > 8 or b > 8: print(':(')
else: print('Yay!')

Solution (Python):
A,B = map(int,input().split())
print("Yay!" if A <= 8 and B <= 8 else ":(")

Solution (Python):
a,b = map(int,input().split())

if a > 8 or b > 8:
  print(":(")
else:
  print("Yay!")

Solution (Python):
a, b = [int(i) for i in input().split()]

if a <= 8 and b <= 8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a,b = map(int,input().split())
if a > 8 or b > 8:
    print(':(')
else:
    print('Yay!')

Solution (Python):
a, b = list(map(int,input().split()))
if a <= 8 and b <=8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a, b = map(int, input().split())
if a <= 8 and  b <= 8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
A=list(map(int,input().split()))

if max(A)<=8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
A, B = map(int, input().split())
if A > 8 or B > 8:
    print(":(")
else:
    print("Yay!")

Solution (Python):
a,b = map(int,input().split())
print ("Yay!") if a <= 8 and b <= 8 else print (":(")

Solution (Python):
a, b = sorted(map(int, input().split()))
if b <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
def actual(a, b):
    if a >= 9 or b >= 9:
        return ':('

    return 'Yay!'

a, b = map(int, input().split())
print(actual(a, b))

Solution (Python):
a,b = map(int, input().split())

if a > 8 or b > 8:
  print(":(")
else:
  print("Yay!")

Solution (Python):
A,B = map(int,input().split())

if A<=8 and B<=8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a,b = map(int,input().split())
if a > 8 or b > 8:
    print(":(")
else:
    print("Yay!")

Solution (Python):
a, b = map(int, input().split())
if a <= 8 and b <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
def main():
    a, b = map(int, input().split())

    if a <= 8 and b <= 8:
        print('Yay!')
    else:
        print(':(')

if __name__ == '__main__':
    main()

Solution (Python):
a = list(map(int,input().split()))
print("Yay!" if a[0]<=8 and a[1]<=8 else ":(")

Solution (Python):
a = list(map(int,input().split()))
if a[0]<=8 and a[1]<=8:
    print("Yay!\n")
else:
    print(":(")

Solution (Python):
A,B = map(int,input().split())

print('Yay!' if A <= 8 and B <=8 else ':(')

Solution (Python):
a,b = map(int, input().split())
if a<= 8 and b<= 8:
    print("Yay!")
else:
    print(":(")

Solution (Python):

a,b=map(int,input().split())



if a<=8 and b<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a,b=map(int,input().split())
if a>8 or b>8:
    print(':(')
else:
    print('Yay!')

Solution (Python):
A,B=map(int,input().split())

if A>8 or B>8:
  print(':(')
else:  
  print('Yay!')

Solution (Python):
a,b = map(int,input().split())
c = 16 // 2
if a <= c and b <= c:
    print('Yay!')
else:
    print(':(')

Solution (Python):
A, B = map(int, input().split())
cake = [0]*16
for i in range(A):
  try:
    cake[i*2] = 1
  except:
    print(':(')
    exit()
for i in range(B):
  try:
    cake[(i*2)+1] = 1
  except:
    print(':(')
    exit()
print('Yay!')

Solution (Python):
print('Yay!') if max(map(int, input().split())) <= 8 else print(':(')

Solution (Python):
A, B = map(int, input().split())
print('Yay!' if A<=8 and B<=8 else ':(')

Solution (Python):
def main():
    
    a,b = map(int, input().split())
    if a <= 8 and b <= 8:
        print("Yay!")
    else:
        print(":(")
    
if __name__ == '__main__':
    main()

Solution (Python):
A,B=map(int,input().split())
if max([A,B])>8:
  print(":(")
else:
  print("Yay!")

Solution (Python):
a,b = map(int, input().split())
print("Yay!" if a<=8 and b<=8 else ":(")

Solution (Python):
n_str = input()
a_str, b_str = n_str.split()
a = int(a_str)
b = int(b_str)

if a <= 8:
    if b <= 8:
        print('Yay!')
    else:
        print(':(')
elif a > 8:
    print(':(')

Solution (Python):
a,b=map(int,input().split())
if a<=8 and b<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
A,B=map(int,input().split())
if A<=8 and B<=8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a, b = map(int, input().split())

if a < 9 and b < 9:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a, b = map(int, input().split())
ans = 'Yay!'
if a > 8 or b > 8:
    ans = ':('
print(ans)

Solution (Python):
from sys import stdin
A, B = [int(x) for x in stdin.readline().rstrip().split()]
if A<=8 and B<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a, b = map(int, input().split())
print("Yay!" if a<=8 and b<=8 else ":(")

Solution (Python):
a, b= map(int, input().split())
if a <= 8 and b <= 8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
def resolve():
    A, B = map(int, input().split())
    print("Yay!" if A<=8 and B<=8 else ":(")
resolve()

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools



sys.setrecursionlimit(10**7)






A, B =  map(int,input().split())
if(A<=8 and B<=8):
    print("Yay!")
else:
    print(":(")

Solution (Python):
a,b = map(int, input().split())
if max(a, b) > 8:
  print(":(")
else:
  print("Yay!")

Solution (Python):
a,b=map(int,input().split())
if  a<=8 and b<=8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a, b = map(int, input().split())
if a > 8 or b > 8:
  print(':(')
else:
  print('Yay!')

Solution (Python):
n,m = map(int,input().split())
if n > 8 or m > 8:
    print(":(")
else:
    print("Yay!")

Solution (Python):
a,b=map(int,input().split())
if a<=8 and b<=8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a,b = map(int,input().split())
if a<= 8 and b <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):

import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A = np.array(lr())
bl = np.all(A <= 8)
print('Yay!' if bl else ':(')

Solution (Python):
A, B = map(int, input().split())

if A <= 8 and B <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a, b = map(int, input().split())
if a>8 or b>8:
  print(':(')
else:
  print('Yay!')

Solution (Python):
l = input().split()
a = int(l[0])
b = int(l[1])
if (a>8) or (b>8):
    print(":(")
else:
    print("Yay!")

Solution (Python):
n, m = map(int, input().split())

if n > 8 or m > 8:
  print(':(')
else:
  print('Yay!')

Solution (Python):
a,b=map(int,input().split())

print('Yay!' if (a<=8 and b<=8) else ':(')

Solution (Python):
a, b = map(int, input().split())
if a<=8 and b<=8:
    print('Yay!')
else:
    print(':(')

Solution (Python):

import sys


def solve(A: int, B: int):
    if A <= 8 and B <= 8:
        print("Yay!")
    else:
        print(":(")
    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))  
    solve(A, B)


if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split())
print('Yay!' if a<9 and b<9 else ':(')

Solution (Python):
a,b=list(map(int,input().split()))
print('Yay!' if a<=8 and b<=8 else ':(')

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

a,b = nm()

if a>8 or b>8:
  print(':(')
else:
  print('Yay!')

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
A, B = map(int, input().split())
print("Yay!" if A <= 8 and B <= 8 else ":(")

Solution (Python):
A, B = map(int, input().split())

if A <= 8 and B <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
A,B=map(int, input().split())
if A > 8 or B > 8 :
    print (":(")
else :
    print ( "Yay!")

Solution (Python):
a,b=map(int,input().split())
if a<9 and b<9:
  print("Yay!")
else:
  print(":(")

Solution (Python):
A,B=map(int,input().split())
print("Yay!" if A<=8 and B<=8 else ":(")

Solution (Python):

a, b = map(int, input().split())
print("Yay!") if a <= 8 and b <= 8 else print(":(")

Solution (Python):
A, B = map(int, input().split())
cakes = 'E'*A + 'S'*B + '0' *(16-A-B)

while 'ES' in cakes:
    cakes = cakes.replace('ES', '')
while 'E0' in cakes:
    cakes = cakes.replace('E0', '')
while 'S0' in cakes:
    cakes = cakes.replace('S0', '')

if 'EE' in cakes or 'SS' in cakes:
    print(':(')
else: print('Yay!')

Solution (Python):
a, b = map(int, input().split())
 
if a <= 8 and b <= 8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a, b = map(int, input().split())

if a<=8 and b<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a, b = map(int, input().split())
print("Yay!" if a <= 8 and b <= 8 else ":(")

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
if a < 9 and b < 9:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a,b=map(int,input().split())
print('Yay!' if a<=8 and b<=8 else ':(')

Solution (Python):
import sys
sys.setrecursionlimit(10**6)

a,b=map(int,input().split())

if a<=8 and b<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a, b = map(int, input().split())
if a > 8 or b > 8:
    print(":(")
else:
    print("Yay!")

Solution (Python):
A, B = map(int, input().split())
if A <= 8 and B <= 8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a,b=map(int,input().split())
if a<=8 and b<=8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a,b=map(int,input().split())
if a<9 and b<9:
  print("Yay!")
else:
  print(":(")

Solution (Python):
[A,B] = list(map(int,input().split()))
if A<=8 and B<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a,b=map(int,input().split())

if a<=8 and b<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
x, y = map(int, input().split())
if x <= 8 and y <= 8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
import sys
debug_mode = False




def readInput():
    lines = []
    if debug_mode:
        f = open('input.txt', 'r', encoding='utf-8')
        lines = f.readlines()
    else:
        for line_input in sys.stdin:
            lines.append(line_input)
    
    return list(map(lambda x:x.rstrip(), lines))

def main(lines):
    cake_list = lines[0].split()
    success = True
    for cake in cake_list:
        if 16 / int(cake) < 2:
            success = False
            break
    if success:
        print('Yay!')
    else:
        print(':(')
main(readInput())

Solution (Python):
def resolve():
	a, b = map(int, input().split())
	if a > 8 or b > 8:
		print(':(')
	else:
		print('Yay!')
resolve()

Solution (Python):
x,y=map(int,input().split())
if(x>8 or y>8):
    print(":(")
else:
    print("Yay!")

Solution (Python):
a, b = map(int, input().split())

if a <= 8 and b <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18


a, b = Is()
if a > 8 or b > 8:
    print(':(')
else:
    print('Yay!')

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=map(int, input().split())
    if a<=8 and b<=8:
        print('Yay!')
    else:
        print(':(')
resolve()

Solution (Python):
A,B = map(int,input().split())
if (A<=8)and(B<= 8):
  print("Yay!")
else:
  print(":(")

Solution (Python):
a, b = list(map(int, input().split()))
if max(a, b) < 9:
    print('Yay!')
else:
    print(':(')

Solution (Python):
n, k = map(int, input().split())

if n <= 8 and k <= 8:
    ans = "Yay!"
else:
    ans = ":("

print(ans)

Solution (Python):
A, B = map(int, input().split())

if A<9 and B<9:
  print('Yay!')
else:
  print(':(')

Solution (Python):
A, B = map(int, input().split())

if (A < 9 and B < 9):
    print('Yay!')
else:
    print(':(')

Solution (Python):
A,B=map(int,input().split())
if max(A,B) <=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
a, b = [int(x) for x in input().split()]
print("Yay!" if a <= 8 and b <= 8 else ":(")

Solution (Python):
a,b=map(int,input().split())
if max(a,b)<=8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a, b = map(int, input().split())
if a <= 8 and b <= 8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
A,B = map(int,input().split())
if max(A,B) <= 8:
	print("Yay!")
else:
	print(":(")

Solution (Python):
a,b = map(int, input().split())
if(a<9 and b<9):
    print("Yay!")
else:
    print(":(")

Solution (Python):
a,b = map(int,input().split())
if a<9and b<9:
  print('Yay!')
else:
  print(':(')

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


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





A,B = inputIL()

if A<=8 and B<=8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a,b=map(int,input().split())
if a<=8 and b<=8:
  print("Yay!")
else:
  print(":(")

Solution (Python):
a, b = map(int, input().split())
if a <= 8 and b <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
a, b = map(int, input().split())
if max(a, b) <= 8:
  print('Yay!')
else:
  print(':(')

Solution (Python):
a,b=map(int,input().split())
if abs(a-b)<=(16-a-b):
    print('Yay!')
else:
    print(':(')

Solution (Python):
a,b=map(int,input().split())
if a+b<=16 and a<=8 and b<=8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
A, B = map(int, input().split(' '))

diff = abs(A - B)
total = A + B
rest = 16 - total

if rest >= diff:
    print('Yay!')
else:    
    print(':(')

Solution (Python):
a=input().split(" ")
b=int(a[0])
c=int(a[1])
if c>8 or b>8:
  print(":(")
else:
  print("Yay!")

Solution (Python):
a,b=map(int,input().split())
print("Yay!"if a<=8 and b<=8 else ":(")

Solution (Python):
def ABC_100_A():
    A,B = map(int, input().split())
    
    if A <= 8 and B <= 8:
        print('Yay!')
    else:
        print(':(')

if __name__ == '__main__':

    ABC_100_A()

Solution (Python):
a, b = map(int, input().split())
print('Yay!' if a <= 8 and b <= 8 else ':(')

Solution (Python):
A,B=map(int,input().split())
print('Yay!' if (A<=8 and B<=8) else ':(')

Solution (Python):
A,B = map(int, input().split())
if A > 8 or B > 8:
    print(":(")
else:
    print("Yay!")

Solution (Python):
A,B = map(int,input().split())

if A<=8 and B<=8:
    print("Yay!")
else:
    print(":(")

Solution (Python):
A, B = map(int, input().split())
if A < 9 and B < 9:
    print("Yay!")
else:
    print(":(")

Solution (Python):
def main():
    a,b = (int(x) for x in input().split())
    print('Yay!' if a<=8 and b<=8 else ':(')

if __name__ == '__main__':
    main()

Solution (Python):
A, B = map(int, input().split())
if A <= 8 and B <= 8:
    print('Yay!')
else:
    print(':(')

Solution (Python):
m,n = map(int,input().split(" "))
if abs(m-n) < 2:
  print("Yay!")
else:
  print(":(")