Problem:
 Score: 100 points    Problem Statement  A triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.  You will be given three integers A , B , and C . If this triple is poor, print Yes ; otherwise, print No .      Constraints   A , B , and C are all integers between 1 and 9 (inclusive).         Input  Input is given from Standard Input in the following format:  A  B  C       Output  If the given triple is poor, print Yes ; otherwise, print No .        Sample Input 1 5 7 5      Sample Output 1 Yes  A and C are equal, but B is different from those two numbers, so this triple is poor.       Sample Input 2 4 4 4      Sample Output 2 No  A , B , and C are all equal, so this triple is not poor.       Sample Input 3 4 9 6      Sample Output 3 No       Sample Input 4 3 3 4      Sample Output 4 Yes

Solution (Python):
a = map(int, input().split())
if len(set(a) ) == 2:
    print("Yes")
else:
    print("No")

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

if a==b==c: print('No')
elif a==b or a==c or b==c: print('Yes')
else: print('No')

Solution (Python):
A = map(int,input().split())
if len(set(A) ) == 2:
    print("Yes")
else:
    print("No")

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

cor = 0
mis = 0
for i in range(1,3):
	if ABC[0] ==ABC[i]:
		cor += 1
	if ABC[0] !=ABC[i]:
		mis += 1

if mis == 2:
	if ABC[1] == ABC[2]:
		print("Yes")
	else:
		print("No")

elif cor == 1 and mis == 1:
	print("Yes")
else:
	print("No")

Solution (Python):
a,b,c=map(int,input().split())
ans="No"
if a==b:
  if b==c:
    ans="No"
  else:
    ans="Yes"
if b==c:
  if c==a:
    ans="No"
  else:
    ans="Yes"
if c==a:
  if a==b:
    ans="No"
  else:
    ans="Yes"
print(ans)

Solution (Python):
a = list(map(int, input().split()))
s = set(a)
if len(s) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
def is_kawaisou(a, b, c):
    if a == b and a == c:
        return 'No'
    if a == b or b == c or a == c:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(is_kawaisou(a, b, c))

Solution (Python):
lis = list(input().split())
a=lis.count(lis[0])
b=lis.count(lis[1])
c=lis.count(lis[2])
if a+b+c == 5:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C= map(int, input().split()) 
 
if A==B and B==C:
  print("No")
elif A!=B and B!=C and A!=C:
  print("No")
else:
  print("Yes")

Solution (Python):
numbers = map(int, input().split())
print("Yes") if len(set(numbers)) == 2 else print("No")

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

if ABC.count(ABC[0]) == 2 or ABC.count(ABC[1]) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
a_L = list(map(int,input().split()))
if len(set(a_L)) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
a = set(map(int, input().split()))
print("YNeos"[len(a) != 2::2])

Solution (Python):
a,b,c=input().split()
if a==b==c:
    print("No")
elif a==b or b==c or c==a:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(A: int, B: int, C: int):
    if A == B and B == C :
        return NO
    isPoor = A==B or B==C or A==C
    return YES if isPoor else NO



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))  
    print(solve(A, B, C))

if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())
if (a == b and a != c) or (a == c and a != b) or (c == b and a != c):
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
if a==b==c or b!=c and b!=a and c!=a:
  print('No')
else:
  print('Yes')

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

if a == b:
    if a == c:
        print('No')
    else:
        print('Yes')
        
else:
    if a == c or b == c:
        print('Yes')
    else:
        print('No')

Solution (Python):
a,b,c=[int(x) for x in input().split()]
if(a==b and a!=c):print("Yes")
elif(b==c and b!=a):print("Yes")
elif(a==c and b!=a):print("Yes")
else:print("No")

Solution (Python):

X=set(map(int,input().split()))

if len(X)==1:
    print("No")
elif len(X)==2:
    print("Yes")
else:
    print("No")

Solution (Python):
a=sorted(list(map(int,input().split())))
if  a[0]==a[1]:
	if a[1] == a[2]:
		print("No")
	else:
		print("Yes")
else:
	if a[1] == a[2]:
		print("Yes")
	else:
		print("No")

Solution (Python):
ans = list(int(i) for i in input().split()) 
ans.sort()

if ans[0] == ans[1] and ans[1] == ans[2]:
    print("No")
    exit()
    
if ans[0]==ans[1] or ans[1] == ans[2]:
    print("Yes") 
else:
    print("No")

Solution (Python):
A = list(input().split())
if len(set(A)) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
abc = input().split()
intlist = [int(s) for s in abc]
a,b,c = intlist[0],intlist[1],intlist[2]
if (a == b and a != c) | (a == c and a != b) | (b == c and c != a):
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split(" "))
 
if (((a == b) and (b != c)) or 
    ((b == c) and (c != a)) or
    ((c == a) and (a != b))):
  print("Yes")
else:
  print("No")

Solution (Python):

"""
Created on Sun Feb 16 20:59:44 2020

@author: W_Indicate
"""

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



if A == B == C:
    print("No")
elif (A != B)  and (C != B) and (A != C):
    print("No")
else:
    print("Yes")

Solution (Python):
dataList = input().split(" ")

if len(set(dataList)) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
a=list(map(int, input().split()))
if len(set(a))==2:
    print('Yes')
else:
    print('No')

Solution (Python):
input_list = list(map(int, input().split()))
for i in range(len(input_list)):
  strang = 0
  for j in input_list:
    if input_list[i] == j:
      strang += 1
  if strang == len(input_list):
    print("No")
    break
  if strang == len(input_list) - 1:
    print("Yes")
    break
if strang == 1:
  print("No")

Solution (Python):
A,B,C = map(int,input().split())
ans = "No"
if A == B:
    if A != C:
        ans = "Yes"
if A == C:
    if A != B:
        ans = "Yes"
if B == C:
    if A != B:
        ans = "Yes"
print(ans)

Solution (Python):
A, B, C = map(int,input().split())
if A == B and B == C and A == C:
  print("No")
elif A != B and B != C and A != C:
  print("No")
else:
  print("Yes")

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

if a == b == c:
    print("No")
    exit()
elif (a != b != c) and (a != c):
    print("No")
    exit()
print("Yes")

Solution (Python):
a = list(map(int,input().split()))
if len(a) == len(list(set(a))) or len(list(set(a))) == 1:
  print("No")
else:
  print("Yes")

Solution (Python):
i = [int(x) for x in input().split()]
 
if i[0]==i[1]:
  if i[1]!=i[2]:
    print("Yes")
  else:
    print("No")
elif i[0]==i[2]:
  print("Yes")
elif i[1]==i[2]:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int, input().split())
if a==b:
    if a!=c:
        print("Yes")
    else:
        print("No")
elif a!=b:
    if a==c:
        print("Yes")
    else:
        if b==c:
            print("Yes")
        else:
            print("No")

Solution (Python):
i = list(map(int, input().split()))
 
if i[0]==i[1] and i[1]==i[2]:
    print("No")
elif i[0]!=i[1] and i[1]!=i[2] and i[0]!=i[2]:
    print("No")
else:
    print("Yes")

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

if A == B and B == C:
  print("No")
elif A != B and B != C and A != C:
   print("No")
else:
  print("Yes")

Solution (Python):
l=list(map(int,input().split()))
ll=list(set(l))
if len(ll)==2:
    print("Yes")
else:
    print("No")

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

mod_list = set(input_line)
if len(mod_list) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c  = map(int,input().split())
if ( a == b != c or a != b == c or a == c != b):
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c = input().split(' ')
l = []
l.append(a)
l.append(b)
l.append(c)
l = set(l)
n=len(l)
if n == 2:
  print('Yes')
else:
  print('No')

Solution (Python):
a = input().split()
if a[0] == a[1] and a[0] != a[2]:
    print("Yes")
elif a[0] == a[2] and a[0] != a[1]:
    print("Yes")
elif a[1] == a[2] and a[1] != a[0]:
    print("Yes")
else:
    print("No")

Solution (Python):


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

if (a == b and a != c) or (a == c and a != b) or (b == c and a != c):
    print("Yes")
else:
    print("No")

Solution (Python):
a = list(map(int, input().split()))
b = set(a)
if len(b) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
a = list(map(int,input().split()))
b = 0
if a[0]==a[1] and a[1]==a[2]:
    print("No")
elif a[0]!=a[1] and a[1]!=a[2] and a[0]!=a[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
li = list(map(int,input().split()))
a = set(li)
if len(a) == 3 or len(a) == 1:
  print('No')
else:
  print('Yes')

Solution (Python):

ABC = input().split()

A = ABC[0]
B = ABC[1]
C = ABC[2]

if A==B:
	if B==C:
		print("No")
	else:
		print("Yes")
	exit()

if B==C:
	if A==C:
		print("No")
	else:
		print("Yes")
	exit()

if A==C:
	if B==C:
		print("No")
	else:
		print("Yes")
	exit()

print("No")

Solution (Python):
L = set(list(map(int, input().split())))
if len(L)==2:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c = map(int, input().split())
data = [a,b,c]
b1 = len(set(data))

if b1 == 2:
    print('Yes')
    exit()
 
print('No')

Solution (Python):
a,b,c = map(int, input().split())
if (a==b and a!=c) or (a==c and a!=b) or (c==b and c!=a):
  print("Yes")
else:
  print("No")

Solution (Python):
print(['No','Yes'][len(set(map(int,input().split())))==2])

Solution (Python):
def main():
    aa = set(map(int, input().split()))
    print('Yes' if len(aa)==2 else 'No')
main()

Solution (Python):
x,y,z=(input().split(" "))
if z == y:
  if y ==x:
    print("No")
  else:
    print("Yes")
else:
  if z ==x:
    print("Yes")
  else:
    if y == x:
      print("Yes")
    else:
      
      print("No")

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


def main():
    if (N[0] == N[1]) and (N[1] == N[2]) and N[2] == N[0]:
        return 'No'

    if (N[0] != N[1]) and (N[1] != N[2]) and (N[0] != N[2]):
        return 'No'

    return 'Yes'


print(main())

Solution (Python):
a, b, c = map(int, input().split())
if a == b and a == c:
    print("No")
elif a != b and a != c and b != c:
    print("No")
else:
    print("Yes")

Solution (Python):
A, B, C = map(int, input().split())
if (A == B and A != C) or (A == C and A != B) or (B == C and A != B):
    print("Yes")
else:
    print("No")

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

if A == B:
    if A == C:
        print('No')
    else:
        print('Yes')
elif A == C:
    print('Yes')
else:
    if B == C:
        print('Yes')
    else:
        print('No')

Solution (Python):
a,b,c = map(int,input().split())
if ((a==b)&(b!=c))|((a==c)&(a!=b))|((b==c)&(a!=b)):
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a==b and b!=c:
  print("Yes")
elif b==c and c!=a:
  print("Yes")
elif c==a and a!=b:
  print("Yes")
else:
  print("No")

Solution (Python):
a = [int(x) for x in input().split()]
a.sort()
if a[0] == a[1] == a[2]: print("No")
elif a[0] == a[1] or a[1] == a[2]: print("Yes")
else: print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a == b != c or a != b == c or b != a == c:
  print('Yes')
else:
  print('No')

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

if A == B:
    if A == C:
        print('No')
    else:print('Yes')
elif A == C:
    print('Yes')
elif B == C:
    print('Yes')
else: print('No')

Solution (Python):
a=set(list(map(int,input().split())))
if len(a)!=2:print("No")
else:print("Yes")

Solution (Python):
def solve():
    N, M, L = map(int, input().split())
    ans = 'No'
    
    if N == M and M == L:
        return ans
    
    if N == M or M == L or L == N:
        ans = 'Yes'
        
    return ans

print(solve())

Solution (Python):
l = str(input()).split()
 
a = l[0]
b = l[1]
c = l[2]
 
if (a == b and a != c )or (c == b and a != c )or (a == c and b != c ):
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if(a==b and b==c):
    print("No")
elif(a==b or b==c or c==a):
    print("Yes")
else:
    print("No")

Solution (Python):
def solve():
    ABC = list(map(int, input().split()))
    abc = set(ABC)
    if len(abc) == 2:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Solution (Python):
A, B, C = map(int, input().split())
if ((A == B and A != C) or
    (A == C and A != B) or
    (B == C and B != A)):
    print("Yes")
else:
    print("No")

Solution (Python):
set1 = set(map(str, input().split()))

if bool(len(set1) == 3) or bool(len(set1) == 1):
    print("No")
else:
    print("Yes")

Solution (Python):
A,B,C = map(int,input().split())
if A == B and B == C:
    print("No")
elif A == B or A == C or B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
li=[int(e) for e in input().split(' ')]
si=set(li)
if len(si)==2:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = map(int,input().split())
Answer = 'Yes'
if A == B and B == C:
  Answer = 'No'
elif  A !=B and B!=C and C != A:
  Answer = 'No'
print(Answer)

Solution (Python):
x,y,z = map(int,input().split())
if x == y:
  if x == z:
    print("No")
  else:
    print("Yes")
elif x == z:
  if x == y:
    print("No")
  else:
    print("Yes")
elif y == z:
  if x == y:
    print("No")
  else:
    print("Yes")
else:
  print("No")

Solution (Python):
A = list(map(int , input().split()))
if A[0] == A[1] and A[0] != A[2]:
    print('Yes')
elif A[0] == A[2] and A[0] != A[1]:
    print('Yes')
elif A[1] == A[2] and A[1] != A[0]:
    print('Yes')
else:
    print('No')

Solution (Python):
A = set(input().split())

if len(A) == 1:
    print('No')
elif len(A) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=map(int,input().split())
print('No' if a==b==c==a or a!=b!=c!=a else 'Yes')

Solution (Python):
x, y, z = input().split(" ")
a = int(x)
b = int(y)
c = int(z)
poor = False
if a == b == c:
    print('No')
else:
    if a == b:
        poor = not poor

    if a == c:
        poor = not poor

    if b == c:
        poor = not poor

    if poor:
        print('Yes')
    else:
        print('No')

Solution (Python):
l = [int(a) for a in input().split(' ')]

s = list(set(l))

print('Yes' if len(s)==2 else 'No')

Solution (Python):
a, b, c = map(int, raw_input().split())
print 'Yes' if len(set([a, b, c])) == 2 else 'No'

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

if A == B or B == C or A == C:
    if A == B == C:
        print("No")
    else:
        print("Yes")
else:
    print("No")

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

if(A == B):
    count += 1
if(A == C or B == C):
    count += 1
if(count == 1):
    print('Yes')
else:
    print("No")

Solution (Python):
A = map(int, input().split())
if len(set(A) ) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):

A, B, C = map(int, input().split())
D = set([A, B, C])
set_len = len(D)
if set_len == 3 or set_len == 1:
    print('No')
else:
    print('Yes')

Solution (Python):
N =[int(i) for i in input().split(" ")]
count=0
for j in range(len(N)-1):
    for k in range(j+1,len(N)):
        if N[j]==N[k]:
            count += 1
if count==1:
    print("Yes")
else:
    print("No")

Solution (Python):
print("Yes" if len(set(map(int,input().split())))==2 else "No")

Solution (Python):
a=list(map(int,input().split()))
a.sort()
if a[0]==a[1] and a[0]!=a[2]:
  print('Yes')
elif a[1]==a[2] and a[0]!=a[2]:
  print('Yes')
else:
  print('No')

Solution (Python):
num = [x for x in input().split()]
ans = 0
if num[0] == num[1]:
  ans = ans + 1
if num[0] == num[2]:
  ans = ans + 1
if num[1] == num[2]:
  ans = ans + 1

if ans == 1:
  print('Yes')
else:
  print('No')

Solution (Python):
[A,B,C]=[int(i) for i in input().split()]
if A==B:
	if B!=C:
		print("Yes")
	else:
		print("No")
else:
	if B==C:
		print("Yes")
	else:
		if A==C:
			print("Yes")
		else:
			print("No")

Solution (Python):
def main():
    s = str(input()).split(' ');
    cnt = []
    for n1 in s:
        cnt.append(0)
        for n2 in s:
            if n1 == n2:
                cnt[-1] += 1

    for i in cnt[:-1]:
        if i == 2:
            print('Yes')
            break
    else:
        print('No')


main()

Solution (Python):
a,b,c = input().split()
if a == b == c or (a != b and a != c and b != c):
    print('No')
else:
    print('Yes')

Solution (Python):
a=list(map(int,input().split()))
count=0
if a[0]==a[1]:
  count=count+1
if a[0]==a[2]:
  count=count+1
if a[1]==a[2]:
  count=count+1  
if count==1:
  print("Yes")

else:
  print("No")

Solution (Python):
a,b,c = map(int,input().split())
if a==b:
    if a==c:
        print('No')
        exit()
    else:
        print('Yes')
        exit()
if b==c:
    if b==a:
        print('No')
        exit()
    else:
        print('Yes')
        exit()
if c==a:
    if c==b:
        print('No')
        exit()
    else:
        print('Yes')
        exit()
else:
    print('No')
    exit()

Solution (Python):
''' Hey stalker :) '''
INF = 10**10
def main():
    
    ''' Cook your dish here! '''
    li = get_list()
    li.sort()
    if li[0]==li[1]!=li[2] or li[0]!=li[1]==li[2]:
        print("Yes")
    else: print("No")


''' Pythonista fLite 1.1 '''
import sys
from collections import defaultdict, Counter




out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()

print(*out, sep='\n')

Solution (Python):
a,b,c = map(int, input().split())
 
if (a == b) and (b !=c):
	print('Yes')
elif (a == c) and (b !=c):
	print('Yes')
elif (b == c) and (a !=c):
	print('Yes')
else:
	print('No')

Solution (Python):

a,b,c=(int(x) for x in input().split())

if a==b and a!=c :
    print("Yes")
elif a==c and a!=b:
    print("Yes")
elif b==c and b!=a:
    print("Yes")
else :
    print("No")

Solution (Python):
a=list(map(int,input().split()))
if len(set(a))==2:
  print('Yes')
else:
  print('No')

Solution (Python):
def solve():
    A = list(map(int,input().split()))
    for i in range(3):
        if sum(x==A[i] for x in A) == 1 or sum(x==A[i] for x in A) == 3:
            continue
        elif sum(x==A[i] for x in A) ==2:
            print("Yes")
            return
    print("No")

solve()

Solution (Python):
i=list(map(int, input().split()))
if i[0]==i[1] and i[0]!=i[2]:
         print("Yes")
elif i[0]==i[2] and i[0]!=i[1]:
         print("Yes")
elif i[1]==i[2] and i[0]!=i[2]:
         print("Yes")   
else:
         print("No")

Solution (Python):
A = map(int, input().split())
print("Yes" if len(set(A)) == 2 else "No")

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

if(A == B and A != C):
  flag = True
  print('Yes')
elif(A == C and A != B):
  flag = True
  print('Yes')
elif(B == C and A != B):
  flag = True
  print('Yes')
else:
  print('No')

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

if A == B and A != C:
  print('Yes')
elif A == C and A != B:
  print('Yes')
elif B == C and A != B:
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c=input().split()
 
if a==b==c:
  print("No")
elif a==b!=c:
  print("Yes")
elif a==c!=b:
  print("Yes")
elif a!=b==c:
  print("Yes")
else:
  print("No")

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

L = [A,B,C]
L.sort()

if ((L[0] != L[1]) and (L[1] == L[2])) or ((L[0] == L[1]) and (L[1] != L[2])):
    print('Yes')
else:
    print('No')

Solution (Python):
a = list(map(int, input().split()))
f1 = False
f2 = False
f3 = False

if a[0] == a[1]:
    if a[0] != a[2]:
        f1 = True

if a[0] == a[2]:
    if a[0] != a[1]:
        f2 = True

if a[1] == a[2]:
    if a[0] != a[1]:
        f3 = True


if f1 == True or f2 == True or f3 == True:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
if len(set([a, b, c])) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c=map(int,input().split())
if a == b and b == c:
  print("No")
elif a == b or a == c or b == c:
  print("Yes")
else:
  print("No")

Solution (Python):
a,b,c = map(int, input().split())
if a == b == c:
    print("No")
elif a == b:
    print("Yes")
elif b == c:
    print("Yes")
elif c == a:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
nums = input()
a = nums[0] 
b = nums[2]
c = nums[4]

if a == b:
    if b == c:
        print("No")
    else:
        print("Yes")
else:
    if b == c:
        print("Yes")
    elif a == c:
        print("Yes")
    else: 
        print("No")

Solution (Python):
a, b, c = map(int, input().split())
l = []
l.append(a)
l.append(b)
l.append(c)


if len(set(l)) == 2:
  print("Yes")
else:
  print("No")

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

if A == B and B != C:
  print('Yes')
elif A == C and B != C:
  print('Yes')
elif B == C and A != C:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
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(str, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()

if A == B and A != C:
    print('Yes')
elif A == C and A != B:
    print('Yes')
elif B == C and B != A:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c = map(int, input().split())
i = 0
if a == b:
  i += 1
if b == c:
  i += 1
if a == c:
  i += 1
  
  
if i == 1: 
  print('Yes')
else:
  print("No")

Solution (Python):
a, b, c = map(int,input().split())
if a == b:
    if a == c:
        print("No")
    else:
        print("Yes")
elif a == c:
    print("Yes") 
elif b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    a, b, c = map(int, input().split())
    if a == b and b == c:
        print("No")
    elif a == b:
        print("Yes")
    elif b == c:
        print("Yes")
    elif c == a:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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


if a==b and b==c and c==a:
  print("No")
elif a==b or b==c or c==a:
  print("Yes")
else:
  print("No")

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(A: int, B: int, C: int):
    if A==B and C!=A:
        print(YES)
    elif B==C and B!=A:
        print(YES)
    elif C==A and B!=A:
        print(YES)
    else:
        print(NO)
    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))  
    solve(A, B, C)

if __name__ == '__main__':
    main()

Solution (Python):
A,B,C = map(int,input().split())
if A==B and  A!=C:
  print("Yes")
elif A==C and  A!=B:
  print("Yes")
elif B==C and B!=A:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c = map(int, input().split())
if a == b == c:
  print('No')
  exit()
if a != b and b != c and a != c:
  print('No')
  exit()
print('Yes')

Solution (Python):
a, b, c = input().split()
if a == b and c != a and c != b:
    print('Yes')
elif a == c and b != a and b != c:
    print('Yes')
elif b == c and a != b and a != c:
    print('Yes')
else:
    print('No')

Solution (Python):
print("Yes") if len(set(list(map(int, input().split(" ")))))==2 else print("No")

Solution (Python):
a = list(map(int, input().split()))
if len(set(a)) == 2:
    print('Yes')
else:
    print('No')

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

if (a == b) and (a != c):
    print('Yes')
elif (a == c) and (a != b):
    print('Yes')
elif (b == c) and (b != a):
    print('Yes')
else:
    print('No')

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

if a == b and b == c:
    cnt += 1
elif  a != b and b != c and a != c:
    cnt += 1
else:
    pass

if cnt == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
arr = map(int, input().split())
if len(set(arr)) == 2:
    print("Yes")
else:
    print("No")

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

if a == b:
    if a != c:
        print("Yes")
    else:
        print("No")
elif a == c:
    print("Yes")
elif b == c:
    print("Yes")
else:
    print("No")

Solution (Python):
l=list(map(int,input().split()))
s=set(l)
if len(s)==2:
    print("Yes")
else:
    print("No")

Solution (Python):

lst = list(map(int, input().split()))
lst.sort()
if (lst[0] == lst[1] and lst[1]!=lst[2]) or (lst[0] != lst[1] and lst[1]==lst[2]):
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c=input().split()
if a == b:
    if a != c:
        print('Yes')
    else:
        print("No")
elif a == c:
    if a != b:
        print('Yes')
    else:
        print("No")
elif b == c:
    if b != a:
        print('Yes')
    else:
        print("No")
else:
    print("No")

Solution (Python):
import sys
lst = list(map(int,input().split()))
lst1 = list(set(lst))
ans = False
if len(lst1) == 1:
    print('No')
    sys.exit()
if lst.count(lst1[0]) == 1:
    if lst.count(lst1[1]) == 2:
        ans = True
else:
    if lst.count(lst1[1]) == 1:
        ans = True

if ans == True:
    print('Yes')
else:
    print('No')

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


if a == b and a ==c:
    print("No")
elif a == b or b == c or a == c:
    print("Yes")
else:
    print("No")

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

A = INPUT[0]
B = INPUT[1]
C = INPUT[2]

if A == B == C:
    print('No')
elif A != B and B != C and A != C:
    print('No')
else:
    print('Yes')

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

if a==b & b!=c:
  print("Yes")
  exit()
elif a==c & c!=b:
  print("Yes")
  exit()
elif b==c & c!=a:
  print("Yes")
  exit()
print("No")

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

if (a==b and a!=c) or (a==c and a!=b) or (b==c and b!=a):
    print("Yes")
else:
    print("No")

Solution (Python):
a = list(map(int,input().split()))
a.sort()
if a[0] == a[1]:
	if a[1] == a[2]:
		print("No")
	else:
		print("Yes")
else:
	if a[1] == a[2]:
		print("Yes")
	else:
		print("No")

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

if A==B==C:
    print('No')
else:
    if A==B:
        if B!=C:
            print('Yes')
    elif A==C:
        if C!=B:
            print('Yes')
    elif B==C:
        if C!=A:
            print('Yes')
    else:
        print('No')

Solution (Python):
A, B, C = map(int, input().split())
if((A == B or B == C or A == C) and not A == B == C):
  print('Yes')
else:
  print('No')

Solution (Python):
lis = list(map(int,input().split()))
lis = set(lis)
if len(lis) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
print("Yes") if len(set(list(map(int, input().split(" ")))))==2 else print("No")

Solution (Python):
def main():
    a, b, c = map(int, input().split())
    flag = False
    if (a == b and b != c) or (a != b and a == c) or (b == c and a != c):
        flag = True
    if flag: print("Yes")
    else: print("No")

if __name__ == "__main__":
    main()

Solution (Python):
from sys import stdin,stdout
def f(i,j,n,mat):
	ans = -1
	for k in range(n):
		ans += mat[i][k]+mat[k][j]
	return ans

def main():  	
	for x in stdin:
		A = list(map(int,x.split()))
		A.sort()
		if (A[0]==A[1] and A[1]!=A[2]) or (A[0]!=A[1] and A[1]==A[2]):print('Yes')
		else:print('No')

if __name__ == "__main__":
    main()

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    a, b, c = LI()
    if a == b == c:
        print('No')
    elif a == b:
        print('Yes')
    elif a == c:
        print('Yes')
    elif b == c:
        print('Yes')
    else:
        print('No')



if __name__ == "__main__":
    solve()

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

min_num = min(Input_ar)
max_num = max(Input_ar)

if Input_ar.count(min_num)==2 or Input_ar.count(max_num)==2:
  print("Yes")
else:
  print("No")

Solution (Python):
A = list(map(int,input().split()))
ans = [0]*3
for i in range(3):
    for j in range(3):
        if A[i] == A[j]:
            ans[i] += 1
if sum(ans) == 5:
    print('Yes')
else:
    print('No')

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

def poor():
    if A == B:
        if A != C:
            return "Yes"
    elif A == C:
        if A != B:
            return "Yes"
    elif B == C:
        if A != B:
            return "Yes"
    return "No"

print(poor())

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

a = [x for x in set(l) if l.count(x) == 2]

if not a:
  print("No")
else:
  print("Yes")

Solution (Python):

import re
import numpy as np
import math





a, b, c = map(int, input().split())
if a==b:
  if a==c:
    print('No')
  else:
    print('Yes')
else:
  if a==c:
    print('Yes')
  else:
    if b==c:
      print('Yes')
    else:
      print('No')

Solution (Python):
a,b,c = map(int,input().split())
if a==b and a!=c or a==c and a!=b or b==c and a!=b:
    print('Yes')
else:
    print('No')

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

if len(set(A)) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
A = map(int,input().split())
if len(set(A)) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

abc = [int(s) for s in sys.stdin.readline().strip().split(' ')]

a = abc[0]
b = abc[1]
c = abc[2]

is_kawai = False

if a == b:
    if b == c:
        pass
    else:
        is_kawai = True
elif b == c:
    is_kawai = True
elif a == c:
    is_kawai = True

if is_kawai:
    print('Yes')
else:
    print('No')

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



if a[0] == a[1]:
    if a[0] == a[2]:
        print("No")
    else:
        print("Yes")
else:
    if a[0] == a[2]:
        print("Yes")
    else:
        if a[1] == a[2]:
            print("Yes")
        else:
            print("No")

Solution (Python):


def abc155a(s):
    b = False
    if( s[0] == s[1] ):
        if(s[2] != s[0]):
            b = True
    if( s[1] == s[2] ):
        if(s[0] != s[1]):
            b = True
    if( s[2] == s[0] ):
        if(s[1] != s[2]):
            b = True
    return(b)



if(__name__ == '__main__'):
    
    s = input().split(" ")

    b = abc155a(s)

    
    if( True == b ):
        print("Yes")
    else:
        print("No")

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

if A.count(A[0]) == 2 or A.count(A[1]) == 2:
  print('Yes')
else:
  print('No')