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):
def solve():
    A,B,C = [int(i) for i in input().split()]
    set_nums = set([A,B,C])
    if len(set_nums) == 2:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    solve()

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

print("Yes" if len(set({a,b,c})) == 2 else "No")

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

t = [a,b,c]
t.sort()

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

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

print('Yes' if len(set([A, B, C]))==2 else 'No')

Solution (Python):
import sys


def main():
    input = sys.stdin.buffer.readline
    a, b, c = map(int, input().split())
    if len(set([a, b, c])) == 2:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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

else:
    print('No')

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

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

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

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

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

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

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

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

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

if A==B:
    if B==C:
        flg=False
    else:
        flg=True
elif B==C:
    flg=True
elif A==C:
    flg=True
else:
    flg=False

if flg:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
 
if (a == b and a != c) or (b == c and b != a) or (c == a and c != b):
  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=map(int,input().split())
if (A==B and B==C) or (A!=B and B!=C and A!=C) :
    print("No")
else:
    print("Yes")

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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

a,b,c = inpm()

cnt = 0
if a == b:
    cnt+=1
if b == c:
    cnt+=1
if c == a:
    cnt+=1

ans = 'No'
if cnt == 1:
    ans = 'Yes'

print(ans)

Solution (Python):
s = set(input().split())
print('Yes' if len(s) == 2 else 'No')

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

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

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  
NO = "No"  


def solve(A: int, B: int, C: int):
    return [NO, YES][not A == B == C and (A == B or B == C or C == A)]


def main():

    sys.setrecursionlimit(10 ** 6)

    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(f'{solve(A, B, C)}')


if __name__ == '__main__':
    main()

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

ans = "No"
if (A == B and A != C) or (A == C and A != B) or (B == C and A != B):
    ans = "Yes"

print(ans)

Solution (Python):
ls = list(input().split(' '))
if ls.count(ls[0]) == 2 or ls.count(ls[1]) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
a=[int(i) for i in 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 b == c and c == a) or (a != b and b != c and c != a):
    print("No")
else:
    print("Yes")

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

Solution (Python):


def main():

    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:
        ans = 'Yes'

    else:
        ans = 'No'

    print(ans)


if __name__ == "__main__":
    main()

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

print('Yes') if len({A, B, C}) == 2 else print('No')

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

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

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

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

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

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

Solution (Python):
a, b, c = list(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=map(int, input().split())

if a==b and a!=c:
    ans="Yes"

elif a==c and a!=b:
    ans="Yes"

elif b==c and b!=a:
    ans="Yes"

else:
    ans="No"


print(ans)

Solution (Python):
abc = input().split()
print('Yes' if len(set(abc)) == 2 else 'No')

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

Solution (Python):
tmp = input().split(" ")
a = tmp[0]
b = tmp[1]
c = tmp[2]

if tmp.count(a) == 2 or tmp.count(b) == 2:
  print("Yes")
else:
  print("No")

Solution (Python):
nums = input().split()
if len(set(nums)) == 2:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):






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

if (l[0] == l[1] != l[2]):
    print("Yes")
elif (l[0] == l[2] != l[1]):
    print("Yes")
elif (l[0] != l[1] == l[2]):
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
start_time = time.perf_counter()


A = inpl()
A.sort()
if A[0]!=A[2]:
    if A[0]==A[1]:
        print('Yes')
        sys.exit()
    if A[1]==A[2]:
        print('Yes')
        sys.exit()
print('No')



end_time = time.perf_counter()
print('time:', end_time-start_time, file=sys.stderr)

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

if a == b and b == c:
    print('No')

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

else:
    print('Yes')

Solution (Python):


















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    
    A, B, C = list(map(int, lines[0].split()))
    
    
    
    
    
    
    
    

    if max(A, B, C) == min(A, B, C):
        result = 'No'
    elif (A-B)*(B-C)*(C-A) != 0:
        result = 'No'
    else:
        result = 'Yes'

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['5 7 5']
        lines_export = ['Yes']
    if pattern == 2:
        lines_input = ['4 4 4']
        lines_export = ['No']
    if pattern == 3:
        lines_input = ['4 9 6']
        lines_export = ['No']
    if pattern == 4:
        lines_input = ['3 3 4']
        lines_export = ['Yes']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

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

Solution (Python):
def poor():
    
    num_set = set(map(int, input().split()))
    
    if len(num_set) == 2:
        return 'Yes'
    else:
        return 'No'

result = poor()
print(result)

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

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

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):
a, b, c = map(int, input().split())

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

Solution (Python):
a,b,c=map(int,input().split())
if a==b==c:
  print("No")
elif (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):


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

if len(abc) == 2:
  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() )
X = [A,B,C]
if len( set( X) ) == 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):
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import itertools
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

A,B,C = MI()

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()))
if len(set(a)) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
from itertools import *

for a,b,c in permutations( map(int, input().split()), 3):
    if a==b and b != c:
        print("Yes")
        exit()

print("No")

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

flag = False

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

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

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

Solution (Python):
import sys
array = list(map(int,input().split()))
set_array = set(array)

if not ( 1 <= min(array) and max(array) <= 9 ): sys.exit()

print('Yes') if len(set_array) == 2 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):
print("Yes" if len({ i : 1 for i in list(map(int, input().split())) }) == 2 else "No")

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

Solution (Python):
a, b, c = list(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):
s=list(map(int,input().split()))
ans="Yes" if len(set(s))==2 else "No"
print(ans)

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

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

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

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

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

Solution (Python):

import collections as cl
import sys


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


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def main():
    a, b, c = MI()

    n = set([a, b, c])
    print("Yes" if len(n) == 2 else "No")


main()

Solution (Python):
Num = len(set(input()))

print('No' if Num%2 < 1 else 'Yes')

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

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

Solution (Python):
a,b,c = 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 and b==c) or (a!=b and b!=c and c!=a):
  print("No")
else:
  print("Yes")

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

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

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

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

Solution (Python):
a,b,c =list(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 = 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 or a==c and a!=b or b==c and 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 a != b and b == c:
    print('Yes')
elif a == c and b != c:
    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 != C:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C=map(int,input().split())
if (A==B and A!=C) or (B==C and B!=A) or (C==A and C!=B):
  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):
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())
flag1 = 0
flag2 = 0
flag3 = 0
if a == b:
  flag1 = 1
if b == c:
  flag2 =1
if a == c:
  flag3 =1
if flag1 ==1 and flag2 ==1:
  print("No")
elif flag1 ==0 and flag2 ==0 and flag3 == 0:
  print("No")
else:
  print("Yes")

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

Solution (Python):
print("NYoe s"[len({*(input())})==3::2])

Solution (Python):
import sys
import itertools

import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines



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

Solution (Python):
import numpy as np
abc = np.array(list(map(int, input().split())))
key, cnt = np.unique(abc, return_counts=True)
print('Yes' if key.size == 2 else 'No')

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

nums.sort()

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

Solution (Python):

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

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

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

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

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

Solution (Python):
a, b, c = [int(i) for i in input().split(" ")]
 
ab = a == b
bc = b == c
ca = c == a
 
cnt = 0
for r in [ab, bc, ca]:
  if r:
    cnt += 1

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

Solution (Python):
def main():
    a, b, c = (int(i) for i in input().rstrip().split(' '))
    print('No' if (a == b == c) or ((a != b) and (a != c) and (b != c)) else 'Yes')


if __name__ == '__main__':
    main()

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

ans = 'Yes' if (len(A) - 1) == len(set(A)) else 'No'

print(ans)

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

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

if a == b and a!= c:
    print('Yes')
if b == c and b !=a:
    print('Yes')
if c == a and c != b:
    print('Yes')
if a == b == c:
    print('No')
if a != b and a != c and b != c:
    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 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")
elif A == B or A == C or B == C:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c = map(int,input().split())
if len({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 and B!=C and A!=C:
    print('No')
else:
    print('Yes')

Solution (Python):
def main():

    A, B, C = map(int, input().split())
    s = set([A, B, C])
    if len(s) == 2:
        return "Yes"
    return "No"

if __name__ == '__main__':
    print(main())

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

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

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

s = set(li)

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

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

Solution (Python):
from collections import Counter
abc = Counter(input().split())
if len(abc) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
line = list(input().split())
line.sort()
if line[0] != line[2]:
    if line[0] == line[1] or line[1] == line[2]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

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

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

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

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

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

l.sort()

if l[0]==l[1]==l[2] or l[0]!=l[1]!=l[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()
A,B,C = map(int,S.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):
if __name__ == '__main__':
	
	A = set(map(int,input().split()))
	if len(A) == 2:
		print("Yes")
	else:
		print("No")

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


if __name__ == "__main__":
    main()

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

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

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


if l[0]==l[1]!=l[2]:
    print('Yes')
elif l[0]!=l[1]==l[2]:
    print('Yes')
elif l[0]==l[2]!=l[1]:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = input().split()
if C != A == B:
    print("Yes")
elif A != B == C:
    print("Yes")
elif B != C == A:
    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 = list(map(int,input().split()))

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

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

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

Solution (Python):
import collections
l = list(map(int, input().split()))
c = collections.Counter(l)
values, counts = zip(*c.most_common())
if counts[0] == 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 and b!=c and a!=c):
    print("No")
else:
    print("Yes")

Solution (Python):

import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a,b,c = MAP()

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

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 k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
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)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

a = l()
a = list(set(a))

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

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

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

Solution (Python):
import sys
input = sys.stdin.readline

A = sorted(list(map(int,input().split())))
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')

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 = map(int, input().split())
if a==b!=c:
    print("Yes")
elif a==c!=b:
    print("Yes")
elif b==c!=a:
    print("Yes")
else:
    print("No")

Solution (Python):
s, f = sorted(list(map(int, input().split()))), True
if s[0] == s[1] and s[1] != s[2]: f = False
if s[1] == s[2] and s[0] != s[1]: f = False
print('No' if f else 'Yes')

Solution (Python):
li=list(map(int,input().split()))
for i in li:
  if li.count(i)==2:
    print("Yes")
    break
else:
  print("No")

Solution (Python):
t = list(map(int, input().split()))
a = t[0]
b = t[1]
c = t[2]

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

Solution (Python):




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

Solution (Python):
a, b, c = list(map(int, input().split()))
if a == b == c:
  print('No')
elif a == b:
  print('Yes')
elif b == c:
  print('Yes')
elif a == 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 and B !=C and C != A:
    print('No')
else:
    print('Yes')

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, B, C = [int(x) for x in input().split()]

if len({A, B, C}) == 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")
else:
    if B == C or A == C:
        print("Yes")
    else:
        print("No")

Solution (Python):


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

S = set([A,B,C])

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    X = map(int, readline().split())

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

    return


if __name__ == '__main__':
    main()

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

for i in x:
    if i not in s:
        s.add(i)

if len(s) == 2:
    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 B!=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):


import sys
input=sys.stdin.readline

def main():
    A,B,C=map(int,input().split())
    if (A==B or B==C or C==A) and not A==B==C:
        print("Yes")
    else:
        print("No")
    
    
    
if __name__=="__main__":
    main()

Solution (Python):
a, b, c = map(int, input().split())
if a == b != c or b == c != a or c == a != b:
    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 A!=B:
  print("Yes")
elif A==C and A!=B:
  print("Yes")
else:
  print("No")

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

v.sort()

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

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

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

if((A != B and B != C and A != C) or (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 and a!=c) or (a==c and a!=b) or (b==c and b!=a):
    print('Yes')

else:
    print('No')

Solution (Python):
a,b,c = list(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 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):
from collections import Counter
ABC = list(map(int, input().split()))
ABC = Counter(ABC)
if len(ABC) == 2:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

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