def kado(l):
	ans=False
	s=set(l)
	if len(l)==len(s):
		if l[1]==max(l) or l[1]==min(l):
			ans=True
	return ans
f=lambda:list(map(int,input().split()))
a=f()
b=f()
ans=1
for i in range(3):
	for j in range(3):
		aa=a[::]
		bb=b[::]
		aa[i]=b[j]
		bb[j]=a[i]
		if kado(aa) and kado(bb):
			ans=0
			break
print('YNeos'[ans::2])