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
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
a = intl()
a = list(set(a))
if len(a) == 2:
    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,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 = list(map(int, input().split()))

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

Solution (Python):


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

s = set([a,b,c])

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

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

lis = set([a, b, c])

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

Solution (Python):
li = [int(zz) for zz in input().split()]
if len(set(li)) == 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):
ABC = list(map(int, input().split()))

t = list(set(ABC))
if len(t) == 2:
  print('Yes')
else:
  print('No')

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B, C):
    return 'Yes' if len(set([A, B, C])) == 2 else 'No'


def main():
    A, B, C = read_int_n()
    print(slv(A, B, C))


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


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

def solve(A: int, B: int, C: int):
    a = sorted([A, B, C])
    if a[0] == a[1] and a[1] != a[2] or a[1] == a[2] and a[1] != a[0]:
        ret = YES
    else:
        ret = NO
    print(ret)
    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):
def main():
    A, B, C = map(int, input().split())

    ans = "No"
    if len(set((A, B, C))) == 2:
        ans = "Yes"

    print(ans)


main()

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





arr=limii()

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

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

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

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

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    
    import collections

    if len(collections.Counter(list(map(int, input().split()))).most_common()) == 2:
        print('Yes')
        exit(0)
    print('No')


if __name__ == '__main__':
    main()

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

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

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

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

else:
    print("No")

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

Solution (Python):
def num():
    return int(input())
def nums():
    return list(map(int,input().split()))

A,B,C = nums()
s = set()
s.add(A)
s.add(B)
s.add(C)
if len(s) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys
import copy

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

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

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

Solution (Python):
a, b, c = map(int, input().split())
def poor(a, b, c):
    return a == b and b != c
if poor(a, b, c) or poor(b, c, a) or poor(c, a, b):
    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 len(set([A,B,C])) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
a  = [list(map(int, s.split())) for s in open(0)][0]

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

Solution (Python):
import sys
input = sys.stdin.readline
a = set(map(int, input().split()))
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):
l = set(input().split())
if len(l) == 2:
  print('Yes')
else:
  print('No')

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

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

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

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

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

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

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

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

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

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

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

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

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

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

l.sort()

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)
MOD = 10**9+7
 
def input():
    return sys.stdin.readline()[:-1]
 
def main():
    l = list(map(int, input().split()))
    if len(set(l)) == 2:
        print("Yes")
    else:
        print('No')
 
 
if __name__ == "__main__":
    main()

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

if len(K)==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, 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 len(set([a,b,c])) == 2:
    print("Yes")
else:
    print("No")

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

A = list([a,b,c])

B = set(A)

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

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

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

x = set([a, b, c])

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

Solution (Python):

def main():
    from sys import stdin, setrecursionlimit
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

Solution (Python):


from collections import deque, defaultdict
import itertools as ite
import sys
import math
from decimal import *

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

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

Solution (Python):
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')
def Z(f):
    if f:
        print('Yay!')
    else:
        print(':(')
def ispow(n):
    if int(n**.5)**2==n:
        return True
    return False

a = list(map(int,input().split()))
y(len(set(a)) == 2)

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

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

d=set(a)

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

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

l = [a,b,c]

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

Solution (Python):
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) 
def lcm(a,b):return (a*b) // fractions.gcd(a,b) 
def iin(): return int(input()) 
def ifn(): return float(input()) 
def isn(): return input().split() 
def imn(): return map(int, input().split()) 
def fmn(): return map(float, input().split()) 
def iln(): return list(map(int, input().split())) 
def iln_s(): return sorted(iln()) 
def iln_r(): return sorted(iln(), reverse=True) 
def fln(): return list(map(float, input().split())) 
def join(l, s=''): return s.join(l) 
def perm(l, n): return itertools.permutations(l, n) 
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) 
def comb(l, n): return itertools.combinations(l, n) 
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) 
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 
def m_add(a,b): return (a+b) % MOD

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

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

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

Solution (Python):
import sys
range = xrange
input = raw_input

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

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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    vn = vk = vn_k = 1
    for i in range(1, n+1):
        vn = vn * i % modp
        if i == k:
            vk = vn
        if i == n-k:
            vn_k = vn
    return vn * get_inv(vk, modp) * get_inv(vn_k, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp



def main():
    print('Yes' if len(set(lmis()))==2 else 'No')

main()

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 len(set([a,b,c]))==2:
    print('Yes')
else:
    print('No')

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

a = set(nm())
print('YNeos'[len(a) != 2::2])

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())
s = {A, B, C}

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

Solution (Python):
def main():

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

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

Solution (Python):

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

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

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

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

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

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

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

print("Yes" if len(list(set([a,b,c])))==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 = set([int(x) for x in input().split()])

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

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

Solution (Python):

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

Solution (Python):

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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

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

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    A = LI()
    if len(list(set(A))) == 2:
        print("Yes")
    else:
        print("No")

main()

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):
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())
if len(set([a,b,c])) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c = map(int, input().split())
d = [a,b,c]
e = set(d)
if len(e) == 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):
A,B,C = map(int,input().split())
D=set()

D.add(A)
D.add(B)
D.add(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('No')
  exit()
  
if A==B or B==C or A==C:
  print('Yes')
  exit()
  
print('No')

Solution (Python):
s = {int(i) for i in input().split()}
if len(s) == 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):
abc = [int(i) for i in input().split()]
if len(set(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 = set(map(int,input().split()))
if len(a) == 2:
    print("Yes")
else:
    print("No")

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

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))

a = na()
n = set(a)
if len(n) == 2:
    print("Yes")
else:
    print("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 C == A:
  print("Yes")
else:
  print("No")

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

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
def main():
    A, B, C = list(map(int, input().split()))
    if A == B == C:
        print('No')
        return
    if A == B or B == C or C == A:
        print('Yes')
        return
    print('No')


main()

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

Solution (Python):
import sys
import math
import fractions
import bisect
import queue
import heapq
from collections import deque
sys.setrecursionlimit(4100000)

MOD = int(1e9+7)
PI = 3.14159265358979323846264338327950288
INF = 1e18

'''
1行のint=====================================
N, K = map(int, input().split())

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

H, W = map(int, input().split())

L, R = map(int, input().split())

1行のstring=================================
S, T = input().split()

1行の整数配列================================
P = list(map(int,input().split()))

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

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

L = list(map(int,input().split()))
R = list(map(int,input().split()))

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

改行あり整数==================================
X = []
Y = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    X.append(x1)
    Y.append(y1)

A = []
B = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    A.append(x1)
    B.append(y1)

Pair = []
for i in range(N):
    x1,y1=[int(i) for i in input().split()]
    Pair.append((x1, y1))


N行M列の初期化====================================
dp = [[VAL] * RETU for i in range(GYO)]

'''




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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

Solution (Python):
import sys,collections

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

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

def main():
  l=LI()
  l=list(set(l))

  if len(l)==2:
    return 'Yes'
  return 'No'


print(main())

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):
x = set(map(int,input().split()))

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

Solution (Python):

abc = set(input().split())
if len(abc) == 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):
from sys import stdin
li = list(map(int,stdin.readline().rstrip().split()))
li = list(set(li))
if len(li) == 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):
n=[int(i) for i in input().split(" ")]
if len(set(n))==2:
    print("Yes")
else:
    print("No")

Solution (Python):
A,B,C=map(int,input().split())
print(['No','Yes'][A==B!=C or B==C!=A or C==A!=B])

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A=LI()
    if len(set(A))==2:
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

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

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
def fastio():
    from io import StringIO
    from atexit import register
    global input
    sys.stdin = StringIO(sys.stdin.read())
    input = lambda : sys.stdin.readline().rstrip('\r\n')
    sys.stdout = StringIO()
    register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()

def debug(*var, sep = ' ', end = '\n'):
    print(*var, file=sys.stderr, end = end, sep = sep)

INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))

from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

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

Solution (Python):
A, B, C = [int(_) for _ in input().split()]
if A == B == C:
    ans = 'No'
elif A == B or B == C or C == A:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

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())
print('Yes')if len(set([a,b,c]))==2 else print('No')

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,b,c = LI()
    if len(list(set([a,b,c]))) == 2:
        print("Yes")
    else:
        print("No") 
    return


if __name__ == "__main__":
    solve()

Solution (Python):
a = set(map(int, input().split()))
if len(a) == 2:
    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()))
if len(set(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")