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, 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):
abclist=list(map(int,input().split()))
s=set()
for l in abclist:
  s.add(l)
  
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 B!=C) or (C==B 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 B != C:
    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("No")
elif a!=b and b!=c and a!=c:
  print("No")
else:
  print("Yes")

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


main()

Solution (Python):
A, B, C = map(int, input().split())
c = 0
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 A != C:
  print('Yes')
  exit()

if A == C and A!= B:
  print('Yes')
  exit()

if B == C and A != B:
  print('Yes')
  exit()

print('No')

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

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

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

Solution (Python):
def main():
    abc = input().split(" ")
    if len(set(abc)) == 2:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

A,B,C = LI()

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

Solution (Python):
def examA():
    N = LI()
    N.sort()
    if N[0]==N[1] and N[0]!=N[2]:
        print("Yes")
    elif N[1]==N[2] and N[0]!=N[2]:
        print("Yes")
    else:
        print("No")
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

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

Solution (Python):










import math
import string

def intinput():
    return int(input())

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

def splitintinput():
    return map(int,input().split())

A,B,C = splitintinput()
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=list(map(int,input().split()))
n=len(set(A))
print('Yes' if n==2 else'No')

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

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

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

Solution (Python):
L = sorted(map(int, input().split()))
if L[0]==L[1] and L[1]!=L[2]:
  print("Yes")
elif L[1]==L[2] and L[0]!=L[1]:
  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 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):
nums = list(map(int, input().split(' ')))
if len(set(nums)) == 2:
  print('Yes')
else:
  print('No')

Solution (Python):

nums = [int(str) for str in input().strip().split()]

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

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

Solution (Python):


import sys
from collections import Counter

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

li = LIST()

C = Counter(li)
if len(C) == 2:
    Yes()
else:
    No()

Solution (Python):
import itertools
import math
import sys
from collections import Counter

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

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

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

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

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

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

set_ = set()
set_.add(a)
set_.add(b)
set_.add(c)
if len(set_) == 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=map(int,input().split())
d=set([a,b,c])
if len(d)==2:
  print("Yes")
else:
  print("No")

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


if A == B and B != C:
    print("Yes")
    exit()
if B == C and C != A:
    print("Yes")
    exit()
if C == A and A != B:
    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):
input = raw_input
nums = map(int, input().split(" "))
nums = set(nums)

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

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

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

Solution (Python):
A = sorted(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):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    A, B, C = [int(x) for x in input().split()]
    if A == B and B != C:
        print("Yes")
        return
    if C == B and B != A:
        print("Yes")
        return
    if C == A and B != C:
        print("Yes")
        return
    print("No")




if __name__ == '__main__':
    main()

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

Solution (Python):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]


def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

a,b,c = get_all_int()

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

Solution (Python):

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(str, input().split())
nl = lambda: list(map(int, input().split()))
a,b,c=nm()
d=set()
d.add(a)
d.add(b)
d.add(c)
if len(d)==2:
    print('Yes')
else:
    print('No')

Solution (Python):
A = list(map(int, input().split()))
A = sorted(A)
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):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



A,B,C = LI()

if A==B and A!=C:
    print('Yes')
    exit()
if A==C and A!=B:
    print('Yes')
    exit()
if B==C and A!=B:
    print('Yes')
    exit()
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):
arr = list(map(int,input().split()))
if len(set(arr)) == 2:
  print('Yes')
else:
  print('No')

Solution (Python):
import numpy as np

a = list(map(int, input().split()))
a = np.unique(a)
if len(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 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):
N = map(int, input().split())
n_set= set(N)
if len(n_set) == 2:
    print("Yes")
else:
    print("No")

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

a = li()
b = list(set(a))
if len(b) == 2:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
inputs = [int(x) for x in input().split()]
if len(set(inputs)) == 2:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):

import sys
input = sys.stdin.readline

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

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

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

a.sort()
count = 0
for i in range(2):
    if a[i] == a[i+1]:
        count += 1

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

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

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 = sorted([A,B,C])

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

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

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

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

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



if __name__ == "__main__":
    main()

Solution (Python):
A,B,C = map(int,input().split())
a = set()
a.add(A)
a.add(B)
a.add(C)
if len(a) == 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):
abc=list(map(int,input().split()))
set_abc=set(abc)
if(len(set_abc)==2):
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
N, M, L = map(int, input().split())
if ((N == M and M != L) or (N != M and M == L) or (N == L and N != M)):
  print('Yes')
else:
  print('No')

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

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

Solution (Python):

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

num_list = set(num)

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

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

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

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

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

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

if len(numset) == 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 (a==c and a!= b):
	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):
import sys





import time


mod = int(1e9+7)
INF = 1<<29

def main():
    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")
    return

if __name__=='__main__':
    main()

Solution (Python):
a, b, c = map(int, raw_input().strip().split())
a, b, c = sorted([a, b, c])

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

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

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())
l = [a, b, c]
a = set(l)
if len(a) == 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():
    *a, = map(int, input().split())
    st = set(a)
    print('Yes' if len(st) == 2 else 'No')


if __name__ == '__main__':
    main()

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

Solution (Python):
def resolve():
    l = set(map(int, input().split()))

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

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

Solution (Python):
l=list(map(int,input().split()))
l=list(set(l))
if len(l)==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 fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A = MAP()
c = Counter(A)
if len(c) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""


a,b,c = m()

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


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

if len(set(a_L)) == 2:
    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

t = sys.stdin.read()
a, b, c = map(int, t.split())

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

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

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

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

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

if __name__ == "__main__":
    main()

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

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 = list(map(int, input().split()))
if len(set(a)) == 2:
    print('Yes')
else:
    print('No')

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

S = set(ABC)

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

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

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

Solution (Python):
def main():
    A = list( map( int, input().split()))
    A.sort()
    if A[0] == A[1] and A[1] != A[2]:
        print("Yes")
        return
    if A[1] == A[2] and A[1] != A[0]:
        print("Yes")
        return
    print("No")
if __name__ == '__main__':
    main()

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

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

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

st = set(nums)

l = len(st)

if l == 2:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(A: int, B: int, C: int):
    if A==B==C:
        print(NO)
        return
    print(YES if A==B or B==C or A==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):
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=list(map(int,input().split()))
a.sort()
b=a[1]
c=a[2]
a=a[0]
if a==b!=c or a!=b==c:
        print('Yes')
else:
        print('No')

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

if len(se) == 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())
A = [a, b, c]

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

Solution (Python):

import sys
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


def solve(A: int, B: int, C: int):
    if len(set([A, B, C])) == 2:
        yes()
    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):
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial
from bisect import bisect_left 


sys.setrecursionlimit(10**7)
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 = [int(i) for i in input().split()]
b = dict()
for i in a:
    b[i] = 1
if len(b) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
import math
import bisect


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

if __name__ == "__main__":
    main()

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

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

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

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

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

input2 = set(input1)

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

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

Solution (Python):
a = map(int, input().split())
set_num = set(a)
if(len(set_num) == 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):
import sys, bisect, math, itertools, string, queue, copy


from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush

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 sorted([list(map(int, input().split())) for _ in range(n)]) 
def graph():
    n=inp()
    g=[[] for _ in range(n)]
    for i in range(n):
        a = inp()
        a -= 1
        g[i].append(a)
        g[a].append(i)
    return n,g

def main():
    a,b,c = inpm()
    if a==b and b!=c:
        print('Yes')
    elif a==c and b!=c:
        print('Yes')
    elif c==b and b!=a:
        print('Yes')
    else:
        print('No')
if __name__ == "__main__":
    main()

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

def main():
    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())

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

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

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

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


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