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):

import sys

YES = "Yes"  
NO = "No"  


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



from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    a,b,c = mi()
    flag = False
    if a == b:
        flag = True
    if b == c:
        if flag == True:
            print('No')
            exit()
        else:
            flag = True
    if a == c:
        if flag == True:
            print('No')
            exit()
        else:
            flag = True
    if flag:
        print("Yes")
    else:
        print("No")


main()

Solution (Python):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(readline())
def LI(): return [int(x) for x in readline().split()]

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

if __name__ == "__main__":
    main()

Solution (Python):

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


def main():
    a, b, c = map(int, input().split())
    print("Yes" if len({a, b, c}) == 2 else "No")




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

























def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')

def main():
	A,B,C = inputMap()

	if A == B:
		if A != C:
			print("Yes")
			sys.exit()
	elif A == C:
		if A != B:
			print("Yes")
			sys.exit()
	elif B == C:
		if A != B:
			print("Yes")
			sys.exit()

	print("No")

if __name__ == "__main__":
	main()

Solution (Python):
import collections

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

c=collections.Counter(num)

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

Solution (Python):

from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  
from heapq import heappush, heappop
import bisect

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) 
A = [int(input()) for _ in range(N)] 
lst = [list(map(int,input().split())) for i in range(M)] 
"""

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

A = sorted(A)

if A[0] == A[1] and A[1] != A[2]:
  print('Yes')
elif A[0] != A[1] and A[1] == A[2]:
  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 b != a:
    print("Yes") 
else:
    print("No")

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

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

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

Solution (Python):
ABC = [int(s) for s in input().split()]
setABC = set(ABC)
if len(setABC) == 2:
  print("Yes")
else:
  print("No")

Solution (Python):
[A,B,C] = list(map(int,input().split()))
output = 0
if A==B:
    output += 1
if B==C:
    output += 1
if A==C:
    output += 1

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

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

A_dict = dict()
for i in range(len(A)):
    if A[i] in A_dict:
        A_dict[A[i]] += 1
    else:
        A_dict[A[i]] = 1
        
if len(A_dict) == 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:
    if A != B:
        print('Yes')
    else:
        print('No')
elif B == C:
    if B != A:
        print('Yes')
    else:
        print('No')
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 (c==b and a!=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, b, c = map(int, input().split())
flag = False
if a==b  and b!=c:
    flag = True
elif a==c and a!=b:
    flag = True
elif b==c and a!=b:
    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 == c and b != c) or (b == c and a != b)):
    print("Yes")
else:
    print("No")

Solution (Python):
xs = [int(x) for x in input().split()]
xs.sort()
if xs[0] != xs[2] and (xs[0] == xs[1] or xs[1] == xs[2]):
    print('Yes')
else:
    print('No')

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


if __name__ == '__main__':
    resolve()

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

Solution (Python):
line = input().split(' ')
k = set(line)
if len(k) == 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):


import sys
import math

from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint

INF = float('inf')

ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
sys.setrecursionlimit(1000000000)


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



a,b,c = mis()

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 A != C) or (B==C and B != A) or (C==A and C != B):
    print('Yes')
else:
    print('No')

Solution (Python):
'''
n = int(input())
n, m = map(int, input().split())
a = list(map(int, input().split()))
a = [int(input()) for i in range n]
p = [list(map(int, input().split()))]

a = input()
a, b = input().split()
a = [input() for i in range n]
'''

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

ans = "No"

import collections
counter = collections.Counter(Numbers)

for i in counter.values():
    if i == 2:
        ans = "Yes"

print(ans)

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

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

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

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

if a == b and 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 = list(map(int, input().split()))

if len(set([a, b, c])) == 1:
    ans = "No"
elif len(set([a, b, c])) == 2:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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

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

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

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

if A == B:
    if A != C:
        ans = 1
    else:
        ans = 0
elif B == C:
    if B != A:
        ans = 1
    else:
        ans = 0
elif A == C:
    if B!= C:
        ans = 1
    else:
        ans = 0
else:
    ans = 0
if ans == 1:
    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):
S=input().split()
a=int(S[0])
b=int(S[1])
c=int(S[2])

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

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

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

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

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

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

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

Solution (Python):
A = [int(i) for i in input().split()]
if len(set(A)) == 2:
    print("Yes")
else:
    print("No")

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

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

print('Yes' if cnt == 1 else 'No')

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

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

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

Solution (Python):

inp = list(map(lambda x:int(x),input().split()))

if len(set(inp)) == 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):
arr = [int(_) for _ in input().split()]

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

Solution (Python):
t=[int(i) for i in input().split()]
if(len(set(t))==2): print("Yes")
else: print("No")

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

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

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

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

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

Solution (Python):
l = list(map(int, input().split()))
l.sort()
if l[0] == l[1] and l[1] != l[2]:
    print('Yes')
elif l[0] != l[1] and l[1] == l[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 = map(int, input().split())
if len(list(set(A))) == 2:
    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 a!=c:
    print('Yes')    
elif c == a 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 b==c and a!=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 != c or b == c != a or 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 A == C and B != C:
    print("Yes")
elif B == C and A != B:
    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())
count = 0
if A == B:
    count += 1
if B == C:
    count += 1
if A == C:
    count += 1
if count == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
A,B,C = map(int,input().split())
flag = 0
if A==B and A!=C:
    flag=1
elif B==C and A!=B:
    flag=1
elif A==C and A!= B:
    flag=1

if flag==0:
    print('No')
else:
    print('Yes')

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

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

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

Solution (Python):

import sys
input = sys.stdin.buffer.readline


from collections import defaultdict

con = 10 ** 9 + 7

def getlist():
	return list(map(int, input().split()))


def main():
	A, B, C = getlist()
	D = defaultdict(int)
	D[A] += 1
	D[B] += 1
	D[C] += 1
	if len(D) == 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 not A == B == C:
        print('Yes')
    else:
        print('No')
else:
    print('No')

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

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

flag=[0]*3

if A==B:
  flag[0]=1
if B==C:
  flag[1]=1
if C==A:
  flag[2]=1
if sum(flag)==1:
  print("Yes")
else:
  print("No")

Solution (Python):


[A, B, C] = [int(i) for i in input().split()]

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

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

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

ret = "No"
if A == B and A != C:
  ret = "Yes"
elif A == C and A != B:
  ret = "Yes"
elif B == C and B != A:
  ret = "Yes"

print(ret)

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

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

Solution (Python):
A,B,C = input().split()
count = 0
if A == B:
  count += 1
if B == C:
  count += 1
if C == A:
  count += 1
if count == 1:
  print("Yes")
else:
  print("No")

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

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

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

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

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

A, B, C = map(int, sys.stdin.readline().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=sorted(map(int,input().split()))

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

Solution (Python):
a = list(map(int,input().split()))
a.sort()
if (a[0] == a[1] and a[0] != a[2]) or (a[1] == a[2] and a[0] != 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 or (a!=b and b!=c and c!=a):
    print('No')
else:
    print('Yes')

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

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

Solution (Python):
from bisect import bisect_right, bisect_left
from collections import Counter, deque
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import groupby, permutations, combinations, product
from sys import stdin, stderr





def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)





def exgcd(x, y):
    if y == 0:
        return 1, 0
    a, b = exgcd(y, x % y)
    return b, a - (x // y) * b



def lcm(x, y):
    m = gcd(x, y)
    return (x // m) * (y // m)


def main():
    a, b, c = [int(x) for x in input().split()]
    dic = set()
    dic.add(a)
    dic.add(b)
    dic.add(c)
    if len(dic) == 2:
        return 'Yes'
    return 'No'


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

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

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

Solution (Python):

arr = set(map(int, input().split()))
if len(arr) == 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):
def main():
    import sys
    input = sys.stdin.readline

    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')


if __name__ == '__main__':
    main()

Solution (Python):
a=[0,0,0]
a[0],a[1],a[2]=map(int,input().split())
a.sort()

if a[0]==a[1] or a[1]==a[2]:
    if a[0]==a[1] and a[1]==a[2]:
        print("No")
    else:
        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 collections
a = list(map(int,input().split()))
d = collections.Counter(a)
if d.most_common()[0][1] == 2:
    print("Yes")
else:
    print("No")

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def kawaisou(a, b, c):
    if a == b and a != c:
        return True
    if a == c and a != b:
        return True
    if b == c and a != b:
        return True
    return False

def main():
    a, b, c = rli()
    if kawaisou(a, b, c):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

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

Solution (Python):


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

Solution (Python):
val = list(map(int,input().split()))
val.sort()
if val[0] == val[1] and val[1] != val[2]:
    print('Yes')
elif val[1] == val[2] and val[1] != val[0]:
    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):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    A, B, C = MAP()
    c = Counter([A, B, C])

    print("Yes" if len(c.keys()) == 2 else "No")


if __name__ == '__main__':
    main()

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

Solution (Python):



def solve(*args: str) -> str:
    abc = list(map(int, args[0].split()))

    ret = 'No'
    if abc.count(abc[0]) == 2:
        ret = 'Yes'
    if abc.count(abc[1]) == 2:
        ret = 'Yes'
    if abc.count(abc[2]) == 2:
        ret = 'Yes'

    return ret


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

Solution (Python):
A=input().split()
if len(set(A))==2:
    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')
else:
    if A == C:
        print('Yes')
    elif B == C:
        print('Yes')
    else:
        print('No')

Solution (Python):
import math
import itertools




A, B, C= list(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) + (b == c) + (c == a) == 1:
    print('Yes')
else:
    print('No')

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

if len(a) - len(a_s) == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
from itertools import groupby

A,B,C=map(int,input().split())
X=[A,B,C]
X.sort()
X=groupby(X)
s=0
for key,group in X:
    s+=1
if s==2:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = map(int, input().split())
s = set()
s.add(A)
s.add(B)
s.add(C)
if len(s) == 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("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):
a=list(map(int,input().split()))
a=list(set(a))
p=len(a)
if p==1 or p==3:
  print('No')
else:
  print('Yes')

Solution (Python):


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

    ans = 0

    if (a == b):
        ans += 1
    if (b == c):
        ans += 1
    if (a == c):
        ans += 1
    if (ans == 1):
        print("Yes")
    else:
        print("No")

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

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

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

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

if __name__ == '__main__':
    main()

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

Solution (Python):
if __name__ == '__main__':
    a, b, c = list(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 = input().split()
if len(set([a, b, c])) == 2:
    print("Yes")
else:
    print("No")

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

Solution (Python):
l = set([int(i) for i in input().split()])

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

Solution (Python):
A = list(map(int,input().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')

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

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