Problem:
 Score : 100 points    Problem Statement Iroha loves Haiku . Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5 , 7 and 5 syllables, in this order.  To create a Haiku, Iroha has come up with three different phrases. These phrases have A , B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.      Constraints  1≦A,B,C≦10         Input The input is given from Standard Input in the following format:  A  B  C       Output If it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO .        Sample Input 1 5 5 7      Sample Output 1 YES  Using three phrases of length 5 , 5 and 7 , it is possible to construct a Haiku.       Sample Input 2 7 7 5      Sample Output 2 NO

Solution (Python):
from sys import stdin
l = stdin.readline().rstrip().split()

cnt5 = cnt7 = 0

for ln in range(3):
	if l[ln] == '5' : cnt5 += 1
	if l[ln] == '7' : cnt7 += 1

if cnt5 == 2 and cnt7 == 1 : print('YES')
else : print('NO')

Solution (Python):
num=input()
moji=num.split(" ")

if int(moji[0])==7 or int(moji[0])==5:
    pass
else:
    print("NO")

if int(moji[1])==7 or int(moji[1])==5:
	if int(moji[0])+int(moji[1])+int(moji[2])==17:
		print("YES")
	else:
		print("NO")
else:
	print("NO")

Solution (Python):
a, b, c = map(int, input().split())
c5 = (a==5) + (b==5) + (c==5)
c7 = (a==7) + (b==7) + (c==7)
if c5 == 2 and c7 == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
a = input()
print('YES' if a.count('5') == 2 and a.count('7') == 1 else 'NO')

Solution (Python):
a = input().split()
print('YES' if a.count('5') == 2 and a.count('7') == 1 else 'NO')

Solution (Python):
B =  list(map(int, input().split()))
counter = 0
five_seven_five = [5,7,5]
for i in B:
    if i in five_seven_five:
        counter += 1
        five_seven_five.remove(i)
    else:
        print('NO')
if counter ==3:
    print('YES')

Solution (Python):
lis = [int(i) for i in input().split()]
print("YES" if lis.count(5) == 2 and lis.count(7) == 1 else "NO")

Solution (Python):
I = sorted(map(int,input().split()))
if I ==[5,5,7]:
    print('YES')
else:
    print('NO')

Solution (Python):

input_list = list(map(int,input().split()))

sort_list = sorted(input_list)

if(sum(sort_list) == 17):
    if(sort_list[0]==5 and sort_list[1]==5 and sort_list[2]==7):
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Solution (Python):
ABC = input().split()
print("YES" if ABC.count("5") == 2 and ABC.count("7") == 1 else "NO")

Solution (Python):
print("YES" if input() in ("5 5 7", "5 7 5", "7 5 5") else "NO")

Solution (Python):
a = list(map(int, input().split()))
if a.count(5)==2 and a.count(7)==1:
  print("YES")
else:
  print("NO")

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

if (A == 5 or A == 7) & (B == 5 or B == 7) & (C == 5 or C == 7):
    if (A + B + C) == 17:
        print('YES')
    else:
        print('NO')
else:
    print('NO')

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

if L[1]==5:
  print("YES")
else:
  print("NO")

Solution (Python):
l=list(map(int,input().split()))
if(l.count(5)==2 and l.count(7)==1):
  print("YES")
else:
  print("NO")

Solution (Python):
a = input()
print("YES" if a.count("5")==2 and a.count("7")==1 else "NO")

Solution (Python):
s = input()
s = s.split(' ')
s.sort()
if s[0] == '5' and s[1] == '5' and s[2] == '7':
  print('YES')
else:
  print('NO')

Solution (Python):
abc = input().split()
d = abc[0]
e = abc[1]
f = abc[2]
g = d + e + f
g = int(g)
a = 575
b = 557
c = 755

if g == a:
    print("YES")
elif g == b:
    print("YES")
elif g == c:
    print("YES")
else:
    print("NO")

Solution (Python):
f=2
s=1
li = map(int,input().split())
for i in li:
  if i == 5:
    f-=1
  if i == 7:
    s-=1
if f == 0 and s == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
iroha = list(map(int, input().split()))
mylist = sorted(iroha)
if mylist == [5, 5, 7]:
  print("YES")
else:
  print("NO")

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

if A==5 and B==5 and C==7:
  print("YES")
elif A==5 and B==7 and C==5:
  print("YES")
elif A==7 and B==5 and C==5:
  print("YES")
else:
  print("NO")

Solution (Python):
N = list(map(int, input().split()))
if N.count(5) == 2 and N.count(7) == 1:
  print("YES")
else:
  print("NO")

Solution (Python):
nums = list(map(int, input().split(" ")))
 
if sum(nums) == 17 and (5 in nums) and (7 in nums):
  print("YES")
else:
  print("NO")

Solution (Python):
a,b,c = map(int,input().split())
if ( (a+b+c ==17) and (a==5 or b==5 or c==5) and (a==7 or b==7 or c==7)):
    print("YES")
else:
    print("NO")

Solution (Python):
ln = sorted(list(map(int, input().split())))
if ln[0] == ln[1] ==5 and ln[2] ==7:
    print('YES')
else:
    print('NO')

Solution (Python):
abc = list(map(int, input().split()))
if abc.count(5) == 2 and abc.count(7) == 1:
    print("YES")
else:
    print("NO")

Solution (Python):
myList = list(map(int, input().split()))
if myList.count(5)==2 and myList.count(7)==1:
  print('YES')
else:
  print('NO')

Solution (Python):
a,b,c=map(int, input().split())
if a==5 and b==5 and c==7:
  print('YES')
elif a==5 and b==7 and c==5:
  print('YES')
elif a==7 and b==5 and c==5:
  print('YES')
else:
  print('NO')

Solution (Python):
N = list(map(int, input().split()))
if N.count(5) == 2 and N.count(7) == 1:
  print("YES")
else:
  print("NO")

Solution (Python):
s = list(map(int,(input().split())))
s = sorted(s)
if s == [5, 5, 7]:
    print("YES")
else:
    print("NO")

Solution (Python):
A = input().split()
print("YES" if A.count("5") == 2 and A.count("7") == 1 else "NO")

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

if A == [5,5,7]:
    print("YES")
else:
    print("NO")

Solution (Python):
import sys
import math
 
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
 
def main():
    s = list(map(int,input().split()))
    if sum(s) == 17:
      print("YES")
    else:
      print("NO")
 
if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())
if a == b == 5 and c == 7:
  print("YES")
elif a == c == 5 and b == 7:
  print("YES")
elif b == c == 5 and a == 7:
  print("YES")
else:
  print("NO")

Solution (Python):
user_input = list(map(int, input().split()))
five = 0
seven = 0
for i in range(3):
    if user_input[i] == 5:
        five += 1
    elif user_input[i] == 7:
        seven += 1

if five == 2 and seven == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
n=input().split()
print("YES" if n.count("5")==2 and n.count("7")==1 else "NO")

Solution (Python):
a,b,c=(int(x) for x in input().split())
if a==b==5 and c==7:
    print('YES')
elif b==c==5 and a==7:
    print('YES')
elif c==a==5 and b==7:
    print('YES')
else:
    print('NO')

Solution (Python):



def main():
    input_list = input().split()

    if input_list.count("5") == 2 and input_list.count("7") == 1:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()

Solution (Python):
I = sorted((map(int, input().split())))
if I == [5, 5, 7]:
    print('YES')
else:
    print('NO')

Solution (Python):
input_575 = list(map(int, input().split()))
li_575 = [5, 7, 5]
for i in input_575:
    if i in li_575:
        li_575.pop(li_575.index(i))
if len(li_575) == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
a,b,c=map(int,input().split())
if (a+b+c==17):
  print('YES')
else:
  print('NO')

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

if list == [5,5,7]:
    print("YES")
elif list == [5,7,5]:
    print("YES")
elif list == [7,5,5]:
    print("YES")
else:
    print("NO")

Solution (Python):
abc = list(map(int, input().split()))
abc.sort()
if (abc[0]==5) and (abc[1]==5) and (abc[2]==7):
  print('YES')
else:
  print('NO')

Solution (Python):

l=list(map(int,input().split()))

if l.count(5)==2 and l.count(7)==1:
    print('YES')

else:
    print('NO')

Solution (Python):
num = list(map(int, input().split()))
result = 'YES'
try:
    num.remove(5)
    num.remove(7)
    num.remove(5)
except:
    pass
    result = 'NO'

print(result)

Solution (Python):
a,b,c = map(int,input().split())
if a == 7:
    if b == 5 and c == 5:
        print('YES')
    else:
        print('NO')
elif b == 7:
    if a == 5 and c == 5:
        print('YES')
    else:
        print('NO')
elif c == 7:
    if a == 5 and b == 5:
        print('YES')
    else:
        print('NO')
else:
    print('NO')

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

five = 0
seven = 0

for i in l:
  if i ==5:
    five += 1
  elif i ==7:
    seven += 1
if five ==2 and seven ==1:
  print("YES")
else:
  print("NO")

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

five = 0
seven = 0

for i in l:
  if i == 5:
    five += 1
  elif i == 7:
    seven += 1
if five ==2 and seven ==1:
  print("YES")
else:
  print("NO")

Solution (Python):
from collections import Counter
ns = Counter([int(i) for i in input().split()])
if ns[5] == 2 and ns[7] == 1:
    print("YES")
else:
    print("NO")

Solution (Python):
x = input().split()
five = 0
seven = 0
for i in x:
  if i == '5':
    five += 1
  if i == '7':
    seven += 1
if five == 2 and seven == 1:
  print('YES')
else:
  print('NO')

Solution (Python):
S = input().split()
S = [int(x) for x in S]
N = S.count(5)
M = S.count(7)
if N==2 and M == 1:
  print("YES\n")
else:
  print("NO\n")

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

if s.count(5) == 2 and s.count(7) == 1:
  print('YES')
else:
  print('NO')

Solution (Python):
A, B, C, = map(int, input().split())
x = [A, B, C]
print("YES" if x.count(5) == 2 and x.count(7) == 1 else "NO")

Solution (Python):
if __name__ == '__main__':
  haiku = input()
  if haiku.count('5') == 2 and haiku.count('7') == 1:
    print('YES')
  else:
    print('NO')

Solution (Python):
n=input().split()
print("YES" if n.count("5")==2 and n.count("7")==1 else "NO")

Solution (Python):
a=list(map(int,input().split()))
a.sort()
if a==[5,5,7]:
    print('YES')
else :
    print('NO')

Solution (Python):
n = list(map(int, input().split()))
if n.count(5) == 2 and n.count(7) == 1:
  print('YES')
else:
  print('NO')

Solution (Python):
import itertools

str_list = list(input().split())
a = list(itertools.permutations(str_list, 3))
tanka_list = ('5', '7', '5')
for s in a:
    if tanka_list == s:
        print('YES')
        exit()
print('NO')

Solution (Python):
from functools import reduce
from operator import mul

s = reduce(mul, map(int, input().split(' ')))
print('YES' if s == 175 else 'NO')

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

if 5 in nums and 7 in nums and sum(nums)==17:
    print('YES')
else:
    print('NO')

Solution (Python):
a=list(map(int,input().split()))
if a.count(5)==2 and a.count(7)==1:
    print("YES")
else:
    print("NO")

Solution (Python):
a = list(map(int,input().split(" ")))
b = [5,5,7]
a.sort()
if b == a:
 print("YES")
else:
 print("NO")

Solution (Python):
a = []
a = input().split(' ')

if '5' in a:
    a.remove('5')
    if '7' in a:
        a.remove('7')
        if '5' in a:
                print('YES')
        else:
            print('NO')
    else:
        print('NO')
else:
    print('NO')

Solution (Python):
l=sorted(list(map(int,input().split())))
print("YES" if l[0]==l[1]==5 and l[2]==7 else "NO")

Solution (Python):
a, b, c = map(int, input().split())
def iroha(a,b,c):
    if (a==5 or a==7) and (b==5 or b==7) and (c==5 or c==7) and a+b+c==17:
        return "YES"
    else:
        return "NO"
print(iroha(a,b,c))

Solution (Python):
n = list(map(int, input().split()))
n.sort()
print("YES" if n[0] == 5 and n[1] == 5 and n[2] == 7 else "NO")

Solution (Python):
a = [int(x) for x in input().split()]
five = 0
seven = 0
for i in a:
  if i == 5:
    five += 1
  elif i == 7:
    seven += 1
if five == 2 and seven == 1:
  print('YES')
else:
  print('NO')

Solution (Python):
a=list(map(int,input().split()))
a.sort()
if a==[5,5,7]:
    print('YES')
else:
    print('NO')

Solution (Python):
print("YES") if sorted(list(map(int, input().split(" ")))) == [5,5,7] else print("NO")

Solution (Python):
a = input().split()
b = sorted(a)
if b == ['5','5','7']:
    print('YES')
else:
    print('NO')

Solution (Python):
a = list(map(int,input().split()))
b = sorted(a)
print('YES' if b[0]==5 and b[1]==5 and b[2]==7 else 'NO')

Solution (Python):
s = list(map(int, input().split()))
s = sorted(s)
if s[0] == 5 and s[1] == 5 and s[2] == 7:
    print('YES')
else:
    print('NO')

Solution (Python):
x=list(map(int,input().split()))
if x.count(5)==2 and x.count(7)==1:
  print("YES")
else:
  print("NO")

Solution (Python):
a,b,c=map(int,input().split())
if (a==5 and b==5 and c==7) or (b==5 and c==5 and a==7) or (c==5 and a==5 and b==7):
    print("YES")
else:
    print("NO")

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

if x == [5, 5, 7]:
    print("YES")
else:
    print("NO")

Solution (Python):
x = list(map(int, input().split()))
if x.count(5) == 2 and x.count(7) == 1:
    print("YES")
else:
    print("NO")

Solution (Python):



ins = list(map(int, input().split()))
ins.sort()

if ins == [5, 5, 7]:
    print("YES")
else:
    print("NO")

Solution (Python):
A = list(map(int, input().split()))
A.sort()
B = [5,5,7]
if A == B:
    print("YES")
else:
    print("NO")

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

if A==5:
  if B==5:
    if C==7:
      print("YES")
    else:
      print("NO")
  elif B==7:
    if C==5:
      print("YES")
    else:
      print("NO")
  else:
    print("NO")
elif A==7:
  if B==5 and C==5:
    print("YES")
  else:
    print("NO")
else:
  print("NO")

Solution (Python):
list1 = input().split()
ans = int(list1[0]) * int(list1[1]) * int(list1[2])
 
if ans == 5*5*7:
  print('YES')
else:
  print('NO')

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    l=list(map(int,input().split()))
    l.sort()
    YESNO(l[0]==l[1]==5 and l[2]==7)

if __name__ == '__main__':
    main()

Solution (Python):
d = list(map(int,input().split()))
if d.count(5)==2 and d.count(7) == 1 :
    print("YES")
else :
    print("NO")

Solution (Python):
t=list(map(int,input().split()))
if sorted(t) == [5,5,7]:
    print('YES')
else:
    print('NO')

Solution (Python):
s = list(map(int, input().split()))
tar = [5,7,5]
for a in s:
    for b in tar:
        if a == b:
            tar.remove(b)
            break
if tar == []:
    print("YES")
else:
    print("NO")

Solution (Python):
num = input().split()
if num.count('5') == 2 and num.count('7'):
    print("YES")
else:
    print("NO")

Solution (Python):
x = list(map(int, input().split()))
y = sorted(x)
if y[0] == 5 and y[1] == 5 and y[2] ==7:
    print("YES")
else:
    print("NO")

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

five_count=ABC.count("5")
seven_count=ABC.count("7")

if five_count == 2 and seven_count == 1:
  print("YES")
else:
  print("NO")

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

c5 = 0
c7 = 0
for x in abc:
    if x == 5:
        c5 += 1
    if x == 7:
        c7 += 1

if c5 == 2 and c7 == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
in1 = input().split()
if in1.count("5")==2 and in1.count("7")==1:
	print("YES")
else:
	print("NO")

Solution (Python):
l = list(map(int, input().split()))
n5 = 0
n7 = 0
for i in range(3):
  if l[i] == 5:
    n5 += 1
  elif l[i] == 7:
    n7 += 1
print('YES' if n5 == 2 and n7 == 1 else 'NO')

Solution (Python):
l=list(map(int,input().split()))
print("YES" if l.count(5) == 2 and 7 in l else "NO")

Solution (Python):
l=list(map(int,input().split()))
if l.count(5) == 2 and 7 in l:
    print("YES")
else:
    print("NO")

Solution (Python):
nums = [int(e) for e in input().split()]

if nums.count(5) == 2 and nums.count(7) == 1:
  print('YES')
else:
  print('NO')

Solution (Python):
A,B,C = map(int, input().split())
ABC = [A,B,C]

if sorted(ABC) == [5,5,7]:
    print("YES")
else:
    print("NO")

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

if l.count('5') == 2 and l.count('7') == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
A = list(map(int, input().split()))
A.sort()
if (A[0] == 5) and (A[1] == 5) and(A[2] == 7):
    print('YES')
else:
    print('NO')

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()


N = list(map(int,input().split()))
N.sort()
if sum(N)==17 and int(N[0]) == int(N[1]) == 5:
    print('YES')
else:
    print("NO")

Solution (Python):
iroha = input()
iroha = iroha.split(" ")
iroha = sorted(iroha)
if iroha == ["5", "5", "7"]:
  print("YES")
else:
  print("NO")

Solution (Python):
A, B, C = map(int, input().split())
li = [A, B, C]
li.sort()

print("YES") if li == [5, 5, 7] else print("NO")

Solution (Python):
a,b,c=map(int,input().split())
if(a==5):
    if(b==7 and c==5):
        print("YES")
    elif(b==5 and c==7):
        print("YES")
    else:
        print("NO")
elif(a==7):
    if(b==5 and c==5):
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Solution (Python):
A= list(map(int, input().split()))
if A.count(5) == 2 and A.count(7) == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
abc = [i for i in map(int, input().split())]
if abc.count(5) == 2 and abc.count(7) == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
a = list(map(int, input().split()))
if sum(a) == 17 and a.count(5) == 2:
    print("YES")
else:
    print("NO")

Solution (Python):
iroha = input()
iroha = iroha.split(" ")
iroha = sorted(iroha)
if iroha == ["5", "5", "7"]:
  print("YES")
else:
  print("NO")

Solution (Python):
a = list(input().split())
if a.count('5') == 2 and a.count('7') == 1:
    print('YES')
else:
    print('NO')

Solution (Python):
l = sorted(list(map(int,input().split())))
print ("YES") if l == [5,5,7] else print ("NO")

Solution (Python):
a, b, c = map(int, input().split())
print("YES" if a * b * c == 175 else "NO")

Solution (Python):
li = list(map(int, input().split()))
print("YES" if li.count(5) == 2 and li.count(7) == 1 else "NO")

Solution (Python):
li = list(map(int, input().split()))
li.sort()
print("YES" if li[0] == li[1] == 5 and li[2] == 7 else "NO")

Solution (Python):


import sys






















def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = lmi()
    print('YES') if L.count(5) == 2 and L.count(7) == 1 else print('NO')


if __name__ == "__main__":
    main()

Solution (Python):
a,b,c=list(map(int,input().split()))
s=[a,b,c]
if s.count(5)==2 and s.count(7)==1:
  print("YES")
else:
  print("NO")

Solution (Python):
ABC = list(map(int, input().split()))
cnt_5 = 0
cnt_7 = 0
for e in ABC:
  if e == 5: cnt_5 += 1
  if e == 7: cnt_7 += 1
 
if cnt_5 == 2 and cnt_7 == 1:
  print("YES")
else:
  print("NO")

Solution (Python):
a,b,c=list(map(int,input().split()))
s=[a,b,c]
if s.count(5)==2 and s.count(7)==1:
  print("YES")
else:
  print("NO")

Solution (Python):

b,c=0,0
a=list(map(int,input().split()))

for i in range(3):
    c=c+a[i]
    if a[i]==5:b=b+1

if b==2 and c==17:print("YES")
else:print("NO")

Solution (Python):
A = [int(x) for x in input().split()]
C5 =0
C7 =0
for i in range(3):
    if A[i] == 5:
        C5 += 1
    if A[i] == 7:
        C7 += 1

if C5 == 2 and C7 ==1:
    print("YES")
else:
    print("NO")

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

count5=0
count7=0

for A in As:
    if A=="5":
        count5+=1
    elif A=="7":
        count7+=1

if count5==2 and count7==1:
    print("YES")
else:
    print("NO")

Solution (Python):
a, b, c = map(int,input().split())
d = [a, b, c]
if d.count(5) == 2 and d.count(7) == 1:
    print("YES")
    
else:
    print("NO")

Solution (Python):
def main():
 num = list(map(int,input().split()))
 fiven=0
 sevenn=0
 for i in range(0,3):
  if num[i]==5 :
   fiven+=1
  elif num[i]==7 :
   sevenn+=1
 if fiven==2 and sevenn==1 :
   print('YES')
 else:
   print('NO')
 
main()

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

if S.count(5)==2 and S.count(7)==1:
  print("YES")
else:print("NO")

Solution (Python):
a = list(map(int, input().split()))
print("YES" if a.count(5) == 2 and a.count(7) == 1 else "NO")

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

if A[2] == 7:
    if A[0] == 5 and A[0] == A[1]:
        print("YES")
        
    else:
        print("NO")
else:
    print("NO")

Solution (Python):
n=3
a=[0]*n
b=[5,7,5]
a[:]=map(int,input().split())
a.sort()
b.sort()
if a==b:
  print("YES")
else:
  print("NO")

Solution (Python):
word = input()
if word.count("5") == 2 and word.count("7") == 1:
  print("YES")
else:
  print("NO")

Solution (Python):
X = list(map(int,input().split()))
cou5 = 0
cou7 = 0
for i in X:
    if i ==5:
        cou5 +=1
    if i ==7:
        cou7 +=1

if cou5 == 2 and cou7 ==1:
    print("YES")
else:
    print("NO")

Solution (Python):
l =list(map(int,input().split()))
if l.count(5)==2 and l.count(7)==1:
    print("YES")
else:
    print("NO")

Solution (Python):
X = list(map(int,input().split()))
cou5 = 0
cou7 = 0
for i in X:
    if i ==5:
        cou5 +=1
    if i ==7:
        cou7 +=1

if cou5 == 2 and cou7 ==1:
    print("YES")
else:
    print("NO")

Solution (Python):

a, b, c = map(int, input().split())
l = [a,b,c]

if (l.count(5) == 2) & (l.count(7) == 1):
    print('YES')
else:
    print('NO')

Solution (Python):
length = list(map(int, input().split()))
judge = {0:5,1:7,2:5}

for i in range(len(judge)):
    for j in range(len(length)):
        if length[j] == judge[i]:
            length.pop(j)
            break
        else:
            if j == len(length)-1:
                print('NO')
                exit()
print('YES')

Solution (Python):
A,B,C=(int(x) for x in input().split())

if A==7 and B==5 and C==5:
  print("YES")
elif A==5 and B==7 and C==5:
  print("YES")
elif A==5 and B==5 and C==7:
  print("YES")
else:print("NO")

Solution (Python):
a,b,c = map(int,input().split())
ok = False
if a == 5 and b == 5 and c == 7:
    ok = True
elif a == 5 and b == 7 and c == 5:
    ok = True
elif a == 7 and b == 5 and c == 5:
    ok = True
if ok == 1:
    print('YES')
else:
    print('NO')

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)





l = inputIL()
l.sort()

if l == [5,5,7]:
  print("YES")
else:
  print("NO")

Solution (Python):
print("YNEOS"[sorted(map(int, input().split())) != [5, 5, 7]::2])

Solution (Python):
ABC = input()
print("YES" if ABC.count("5") == 2 and ABC.count("7") == 1 else "NO")

Solution (Python):
a, b, c = map(int, input().split())
x = [5, 7]
if (a + b + c == 17) and (a in x) and (b in x) and (c in x):
    print('YES')
else:
    print('NO')

Solution (Python):
N=list(map(int,input().split()))
if sorted(N)==[5,5,7]:
    print("YES")
else:
    print("NO")

Solution (Python):

"""
Created on Wed May 13 11:57:51 2020

@author: shinba
"""

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

B = [[5,5,7],[5,7,5],[7,5,5]]

if A in B:
    print("YES")
else:
    print("NO")

Solution (Python):
l = map(int, input().split())
print("YES" if sorted(l) == [5, 5, 7] else "NO")

Solution (Python):
l = input().split()
print("YES" if sorted(l) == ['5', '5', '7'] else "NO")

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7
MAX = 10**18
MIN = -10**18

a = list(map(int,input().split()))
a.sort()
if a[0] == 5 and a[1] == 5 and a[2] == 7:
    print("YES")
else:
    print("NO")

Solution (Python):
a,b,c = map(int,input().split())
print("YES" if a*b*c ==175 else "NO")

Solution (Python):
l = list(map(int,input().split()))
x = l.count(5);
y = l.count(7);
if x==2 and y==1:
  print("YES")
else:
  print("NO")

Solution (Python):
s = [int(i) for i in input().split()]
s.sort()
if s == [5,5,7]:
  print("YES")
else:
  print("NO")

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

g = 0
if a == 5:
  g = g + 1
if b == 5:
  g = g + 1
if c == 5:
  g = g + 1

h = 0
if a == 7:
  h = h + 1
if b == 7:
  h = h + 1
if c == 7:
  h = h + 1
  
if h == 1 and g == 2:
  print("YES")
else:
  print("NO")

Solution (Python):
a, b, c = (int(x) for x in input().split())
if a == 5 and b == 5 and c == 7 or a == 5 and b == 7 and c == 5 or a == 7 and b == 5 and c == 5:
  print("YES")
else:
  print("NO")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A = LIST()
if sorted(A) == [5, 5, 7]:
	print("YES")
else:
	print("NO")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A = LIST()
A.sort()

if A == [5, 5, 7]:
	print("YES")
else:
	print("NO")

Solution (Python):
import sys
import math
import bisect

def main():
    A = list(map(int, input().split()))
    A.sort()
    if len(A) == 3 and A == [5, 5, 7]:
        print('YES')
    else:
        print('NO')

if __name__ == "__main__":
    main()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


A = LIST()

A.sort()

if A == [5, 5, 7]:
	print("YES")
else:
	print("NO")

Solution (Python):
A = sorted(input().split())
print('YES' if A == ['5', '5', '7'] else 'NO')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A = LIST()
 
if all(x in A for x in [5,7]) and sum(A) == 17:
	print("YES")
else:
	print("NO")

Solution (Python):
A_B_C = list(map(int, input().split()))
if A_B_C.count(5) == 2 and A_B_C.count(7) == 1:
    print('YES')
else:
    print('NO')

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

count5=0
count7=0

for A in As:
    if A=="5":
        count5+=1
    elif A=="7":
        count7+=1

if count5==2 and count7==1:
    print("YES")
else:
    print("NO")

Solution (Python):
a,b,c = map(int, input().split())
s = {a,b,c}
list1 = [a,b,c]
if s == {5,7} and sum(list1) == 17:
  print("YES")
else :
  print("NO")

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

list_iroha = [A,B,C]


if [5,7,5] == list_iroha or [7,5,5] == list_iroha or [5,5,7] == list_iroha:
  print("YES")
else:
  print("NO")

Solution (Python):

numArray = list(map(int, input().split()))

if numArray.count(5) == 2 and numArray.count(7) == 1: print("YES")
else: print("NO")

Solution (Python):
input_num = input().split()
numbers = {'5':0,'7':0}
for num in input_num:
  if(num=='5' or num=='7'):
    numbers[num] +=1

if(numbers['5']==2 and numbers['7']==1):
  print('YES')
else:
  print('NO')