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

Solution (Python):
def inp():
    return input()
def iinp():
    return int(input())
def inps():
    return input().split()
def miinps():
    return map(int,input().split())
def linps():
    return list(input().split())
def lminps():
    return list(map(int,input().split()))

a,b,c = miinps()

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

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

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

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

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

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

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

if (l[0]+l[1]+l[2])/3 > l[0]:
  if l[0] == l[1] or l[1] == l[2]:
    print("Yes")
  else:
    print("No")
else:
  print("No")

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

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

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

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

count = 0

if num[0] == num[1]:
  count = count + 1

if num[1] == num[2]:
  count = count + 1

if num[2] == num[0]:
  count = count + 1

if count == 1:
  ans = "Yes"
elif count == 0 or count == 3:
  ans = "No"

print(ans)

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

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

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

Solution (Python):
import sys, re
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,copy
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 LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
	se = set(MAP())

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


if __name__=='__main__':
	main()

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

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

Solution (Python):


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

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

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

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==c:
    ans="No"
else:
    if a==b or a==c or b==c:
        ans="Yes"
    else:
        ans="No"
print(ans)

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

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

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

hoge = {a, b, c}

if len(hoge) == 2:
  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 A != C):
    print("No")
else:
    print("Yes")

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

Solution (Python):
p = [int(i) for i in input().split()]
res = []

for i in p:
    if i not in res:
        res.append(i)

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

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

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

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

print(ans)

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

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

Solution (Python):
def is_poor(triple_numbers):
    count_map = {}
    for num in triple_numbers:
        if num not in count_map:
            count_map[num] = 1
        else:
            count_map[num] += 1
    
    for key, value in count_map.items():
        if value == 2:
            return True
    return False

is_p = is_poor(list(map(int, input().split())))

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

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

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

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

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

Solution (Python):
list=[int(x) for x in input().split()]
count=0
list.sort()
for i in range(1,len(list)):
  if list[i-1]==list[i]:
    count=count+1
if count==1:
  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 a == b and b == c:
  print("No")
elif a != b and b != c and a != c:
  print("No")
else:
  print("Yes")

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

Solution (Python):

import sys
L = sys.stdin.readline().split()

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

Solution (Python):




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


if __name__ == "__main__":
    main()

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

boo = False
if a==c or a==b or b==c:
  boo = True
if a==b==c:
  boo = False
  
str = 'Yes' if boo else 'No'
print(str)

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

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

Solution (Python):
num_1, num_2, num_3 = input().split()

if ((num_1 != num_2) and (num_1 != num_3) and (num_2 != num_3)) or (num_1 == num_2 == num_3):
  print("No")
else:
  print("Yes")

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

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

Solution (Python):
x = input().split(' ')

if  x[0] == x[1] != x[2]:
    print("Yes")
elif x[1] == x[2] != x[0]:
    print("Yes")
elif x[2] == x[0] != x[1]:
    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):
s = list(map(int, input().split()))

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

Solution (Python):
a,b,c = input().split()
print('Yes' if len({a,b,c}) == 2 else 'No')

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

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

if a==b and a==c and b==c:
    ans = "No"
elif a!=b and a!=c and b!=c:
    ans = "No"
else:
    ans = "Yes"


print(ans)

Solution (Python):
from collections import Counter

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

L = []
L.append(A)
L.append(B)
L.append(C)

c = Counter(L)

if max(c.values()) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):



def main():
    alpha = set(map(int, input().split()))

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
def resolve():
    A, B, C = map(int, input().split())
    ABC_list = {A, B, C}    

    if len(ABC_list) == 2:
        print("Yes")
    else:
        print("No")
 
if __name__ == "__main__":
    resolve()

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

Solution (Python):

import itertools

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

y=False

for x in itertools.permutations(list):
    if x[0]==x[1] and x[1]!=x[2] :
        y=True
if y==True:
    print("Yes")
else :
    print("No")

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

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

Solution (Python):



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

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

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

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

count = 0
if a == b :
  count += 1

if a == c :
  count += 1

if b ==c :
  count += 1

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

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

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

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

Solution (Python):
import collections
l = list(map(int,input().split()))
c = collections.Counter(l)
c = c.most_common()
if c[0][1] == 2:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    a, b, c = list(map(int, readline().split()))
    if a == b != c or a == c != b or b == c != a:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    s=set(LIST())
    if len(s)==2:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

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

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

Solution (Python):

import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


def main():
    a, b, c = map(int, input().split())
    if a != b and b != c and c != a:
        print('No')
        return
    if a == b and b == c and c == a:
        print('No')
        return

    print('Yes')
    return


if __name__ == '__main__':
    main()

Solution (Python):
A, B ,C = 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 = input().split()
x=a[0]
y=a[1]
z=a[2]
if x==y:
    if x==z:
        print("No")
    else:
        print("Yes")
else:
    if x==z:
        print("Yes")
    else:
        if y==z:
            print("Yes")
        else:
            print("No")

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

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

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

Solution (Python):
def main():
    A, B, C = map(int, input().split())
    if A == B == C:
        print("No")
    else:
        print("Yes" if A ^ B ^ C in (A, B, C) else "No")
    return


main()

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

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

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

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

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

print(ans)

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

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

if len(set(s)) == len(s) - 1:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C = tuple(map(int, input().split(" ")))
k = sorted([A, B, C])
if k[0] == k[1]:
    if k[1] == k[2]:
        print("No")
    else:
        print("Yes")
elif k[1] == k[2]:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
from sys import stdin, stdout

x = list(map(int, stdin.readline().split())) 
y = [x[0]-x[1], x[1]-x[2], x[2]-x[0]]
count = 0
for i in range(3):
  if y[i] == 0:
    count += 1

if count == 1:
  stdout.write("Yes")
else:
  stdout.write("No")

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

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

Solution (Python):


print("Yes") if len(set(input().split())) == 2 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):


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

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

Solution (Python):
nums = input().rstrip().split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2 and n2 == n3 and n1 == n3:
  print("No")
elif n1 != n2 and n2 != n3 and n1 != n3:
  print("No")
else:
  print("Yes")

Solution (Python):
nums = input().rstrip().split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2 and n2 == n3 and n1 == n3:
  print("No")
elif n1 != n2 and n2 != n3 and n1 != n3:
  print("No")
else:
  print("Yes")

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

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

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

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

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

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

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

Solution (Python):

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29

DIV = (10**9) + 7

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)

def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max,mod=DIV):
    fac,finv,inv = [0]*max, [0]*max, [0]*max
    fac[0]=fac[1]=1
    finv[0]=finv[1]=1
    inv[1]=1
    for i in range(2,max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod -inv[mod%i] * (mod//i)%mod
        finv[i] = finv[i-1]*inv[i]%mod
    class CONV:
        def __init__(self):
            pass
        def ncr(self,n,k):
            if(n<k):
                return 0
            if(n<0 or k<0 ):
                return 0
            return fac[n]*(finv[k]*finv[n-k]%mod)%mod
    return CONV()


def main():
    ret = set(isRaw())
    return "Yes" if len(ret) == 2 else "No"


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

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

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

else:
    print("Yes")

Solution (Python):


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

p1 = a == b and b != c 
p2 = a == c and c != b 
p3 = b == c and c != a 

print ['No', 'Yes'][p1 or p2 or p3]

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 sys
a,b,c=( int(i) for i in input().split())

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

else :
    print("No")

Solution (Python):
A = [int(x) for x in input().split()]
from collections import Counter
import sys
c = Counter(A)

for i in c.values():
  if i == 2:
    print("Yes")
    sys.exit()

print("No")

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

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

elif a == c:
  print("Yes")

elif b == c:
  print("Yes")

else:
  print("No")

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

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

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

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

Solution (Python):
list = input()
a = list[0]
b = list[2]
c = list[4]
if a == b:
  if a != c:
    print("Yes")
  else:
    print("No")
else:
  if a == c or b == c:
    print("Yes")
  else:
    print("No")

Solution (Python):
digits = set(input().split(' '))
if len(digits) == 2:
  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 and c==a:
  ans='No'
print(ans)

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

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

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

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

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

isPoor = False

if (a == b or a == c) and b != c:
    isPoor = True
elif (b == a or b == c ) and a != c:
    isPoor = True
elif (c == a or c == b) and a != b:
    isPoor = True

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

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

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

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

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

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

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

else:
  print("Yes")

Solution (Python):
A,B,C = 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):
N = input().split()
A = N[0]
B = N[1]
C = N[2]

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

Solution (Python):
A = sorted([int(x) for x in input().split()])
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 == c or a != b != c != a: print("No")
else: print("Yes")

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

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

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

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

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

Solution (Python):
input_list = input().split(" ")
count = 0

if(input_list[0] == input_list[1]):
  count += 1

if(input_list[0] == input_list[2]):
  count += 1

if(input_list[2] == input_list[1]):
  count += 1

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

Solution (Python):



def main():

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


if __name__ == '__main__':
    main()

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

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

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