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

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

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

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

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

print(ans)

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

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

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

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

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

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

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

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

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

Solution (Python):

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

























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

inf = float('inf')

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

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

	print("No")

if __name__ == "__main__":
	main()

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

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

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

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

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

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

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

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

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

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

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

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

print(ans)

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

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

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

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

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

Solution (Python):
A, B, C = (int(abc) for abc 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())
answer = "Yes" if a==b or b==c or a==c else "No"
print("No" if a==b==c else answer)

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


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

Solution (Python):
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()))
a.sort()
if a[0] == a[1] and a[0] != a[2]:
    print('Yes')
elif a[0] != a[1] and a[1] == a[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
from sys import setrecursionlimit as srl; srl(10**7)
rr = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())
 
A,B,C = rrm()
if A==B!=C or A==C!=B or B==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):
ls = list(map(int, input().split()))

st = set(ls)

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

Solution (Python):
abc=input().split(" ")
A=int(abc[0])
B=int(abc[1])
C=int(abc[2])

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

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

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

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

s = {a, b, c}

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

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

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

if leng == 2:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
import sys
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a = IL()

cnt = 0
for i in range(3):
  for j in range(i+1,3):
    if a[i] == a[j]:
      cnt += 1
if cnt == 1:
  print("Yes")
else:
  print("No")

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

s = set(a)

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

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

Solution (Python):






import math
import statistics
import numpy as np
import queue

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

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

Solution (Python):
S = set([int(i) for i in input().split()])
if len(S) == 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())
if (a == b and a != c) or (a == c and a != b) or (b == c and a != b):
    print('Yes')
else:
    print('No')

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


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

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


main()

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

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

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

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

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

Solution (Python):
a,b,c=sorted([int(i) for i in input().split()])

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

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

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

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

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

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

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

a = set(n)

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

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

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

print(ans)

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 accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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

A, B, C = MAP()

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

if ans == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
A, B, C = [int(x) for x in input().split()]

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
A, B, C  = [int(x) for x in input().strip().split()]
if (A == B and A != C) or (A == C and A != B) or (B == C and A != B):
    print('Yes')
else:
    print('No')

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


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

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

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

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

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

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

Solution (Python):
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
mod=pow(10,9)+7

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)

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

ans = 'No'
if A == B and B == C:
    ans = 'No'
elif A == B or B == C or A == C:
    ans = 'Yes'

print(ans)

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

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

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

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

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

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

if A == B and B == C:
    ans = 'No'
elif A != B and B != C and C != A:
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

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

res = "No"

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

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

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

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

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

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

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

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

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

number_set = set(number)

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

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

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

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

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

Solution (Python):
def s_in():
    return input()

def n_in():
    return int(input())

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

class Interval():
    def __init__(self, li):
        self.li = li
        self.n = len(li)
        self.sum_li = [li[0]]
        for i in range(1, self.n):
            self.sum_li.append(self.sum_li[i-1] + li[i])

    def sum(self, a, b=None):
        if b is None:
            return self.sum(0, a)

        res = self.sum_li[min(self.n-1, b-1)]
        if a > 0:
            res -= self.sum_li[a-1]
        return res

a, b, c = l_in()

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

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

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

Solution (Python):

import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from functools import lru_cache
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(2000)

alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s



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

Yn(len(set([A,B,C]))==2)

Solution (Python):
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

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

Solution (Python):
a = map(int,input().split())
if len(set(a)) == 2:
    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(str,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 or A == C or B == C:
    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]:
    print('Yes')
    exit()
if a[0] != a[1] and a[1] == a[2]:
    print('Yes')
    exit()
print('No')

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

Solution (Python):
A, B, C = [int(x) for x in input().split()]

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

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

Solution (Python):



import sys
readline = sys.stdin.readline
read = sys.stdin.read







a = [int(i) for i in readline().split()]


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

Solution (Python):

MOD = 10 ** 9 + 7
INFI = 10**10

import math

import itertools



import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default






def main():
    a,b,c=map(int,input().split())
    ans="No"
    if a==b and b!=c:
        ans="Yes"
    elif a==c and a!=b:
        ans="Yes"
    elif b==c and a!=b:
        ans="Yes"
    print(ans)

if __name__ == "__main__":
    main()

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

A = [int(x) for x in input().split()]

from collections import Counter

c = Counter(A)

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

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

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

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

ABC.sort()

if ABC[0] == ABC[1] < ABC[2]:
    print('Yes')
elif ABC[0] < ABC[1] == ABC[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):
li = set(input().split())
if len(li) == 2:
    print("Yes")
else:
    print("No")

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

ans = 'No'

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

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

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

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

Solution (Python):
a,b,c = map(int,input().split())
l = list(set([a,b,c]))
if len(l) == 2:
    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):
import sys
input = sys.stdin.readline

def main():
    inp = input().split()
    if len(list(set(inp))) == 2:
        print('Yes')
    else:
        print('No')



if __name__ == "__main__":
    main()

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

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

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

Solution (Python):



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

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

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

Solution (Python):
A, B, C = [int(i) for i in 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 = list(map(int, input().split()))

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

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

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